/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de31.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 10:01:42,770 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 10:01:42,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 10:01:42,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 10:01:42,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 10:01:42,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 10:01:42,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 10:01:42,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 10:01:42,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 10:01:42,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 10:01:42,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 10:01:42,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 10:01:42,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 10:01:42,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 10:01:42,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 10:01:42,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 10:01:42,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 10:01:42,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 10:01:42,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 10:01:42,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 10:01:42,820 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 10:01:42,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 10:01:42,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 10:01:42,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 10:01:42,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 10:01:42,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 10:01:42,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 10:01:42,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 10:01:42,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 10:01:42,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 10:01:42,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 10:01:42,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 10:01:42,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 10:01:42,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 10:01:42,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 10:01:42,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 10:01:42,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 10:01:42,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 10:01:42,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 10:01:42,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 10:01:42,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 10:01:42,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 10:01:42,834 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-08 10:01:42,843 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 10:01:42,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 10:01:42,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 10:01:42,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 10:01:42,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 10:01:42,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 10:01:42,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 10:01:42,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 10:01:42,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 10:01:42,846 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 10:01:42,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 10:01:42,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 10:01:42,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 10:01:42,846 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 10:01:42,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 10:01:42,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 10:01:42,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 10:01:42,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 10:01:42,847 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 10:01:42,847 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 10:01:42,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 10:01:42,847 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-08 10:01:42,847 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
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-08 10:01:43,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 10:01:43,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 10:01:43,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 10:01:43,044 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 10:01:43,050 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 10:01:43,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de31.c
[2022-04-08 10:01:43,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570b09084/77ba14e8011d4e79a0e203d182ff3cfa/FLAG6d9050542
[2022-04-08 10:01:43,438 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 10:01:43,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c
[2022-04-08 10:01:43,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570b09084/77ba14e8011d4e79a0e203d182ff3cfa/FLAG6d9050542
[2022-04-08 10:01:43,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570b09084/77ba14e8011d4e79a0e203d182ff3cfa
[2022-04-08 10:01:43,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 10:01:43,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 10:01:43,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 10:01:43,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 10:01:43,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 10:01:43,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e51e431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43, skipping insertion in model container
[2022-04-08 10:01:43,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 10:01:43,468 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 10:01:43,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c[368,381]
[2022-04-08 10:01:43,584 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 10:01:43,589 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 10:01:43,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c[368,381]
[2022-04-08 10:01:43,599 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 10:01:43,607 INFO L208 MainTranslator]: Completed translation
[2022-04-08 10:01:43,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43 WrapperNode
[2022-04-08 10:01:43,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 10:01:43,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 10:01:43,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 10:01:43,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 10:01:43,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 10:01:43,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 10:01:43,626 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 10:01:43,626 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 10:01:43,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43" (1/1) ...
[2022-04-08 10:01:43,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 10:01:43,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:43,648 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-08 10:01:43,655 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-08 10:01:43,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 10:01:43,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 10:01:43,672 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 10:01:43,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 10:01:43,673 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 10:01:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 10:01:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 10:01:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 10:01:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 10:01:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2022-04-08 10:01:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 10:01:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 10:01:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 10:01:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 10:01:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 10:01:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 10:01:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 10:01:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 10:01:43,718 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 10:01:43,719 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 10:01:43,859 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 10:01:43,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 10:01:43,867 INFO L299 CfgBuilder]: Removed 3 assume(true) statements.
[2022-04-08 10:01:43,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:01:43 BoogieIcfgContainer
[2022-04-08 10:01:43,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 10:01:43,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 10:01:43,870 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 10:01:43,873 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 10:01:43,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:01:43" (1/3) ...
[2022-04-08 10:01:43,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459ccdcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:01:43, skipping insertion in model container
[2022-04-08 10:01:43,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:43" (2/3) ...
[2022-04-08 10:01:43,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459ccdcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:01:43, skipping insertion in model container
[2022-04-08 10:01:43,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:01:43" (3/3) ...
[2022-04-08 10:01:43,875 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de31.c
[2022-04-08 10:01:43,878 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 10:01:43,878 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 10:01:43,916 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 10:01:43,920 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-08 10:01:43,920 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 10:01:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 10:01:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2022-04-08 10:01:43,945 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:43,946 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:43,946 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times
[2022-04-08 10:01:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:43,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255712640]
[2022-04-08 10:01:43,970 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 10:01:43,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times
[2022-04-08 10:01:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:43,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796714240]
[2022-04-08 10:01:43,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:44,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID
[2022-04-08 10:01:44,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID
[2022-04-08 10:01:44,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID
[2022-04-08 10:01:44,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:44,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID
[2022-04-08 10:01:44,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID
[2022-04-08 10:01:44,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID
[2022-04-08 10:01:44,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID
[2022-04-08 10:01:44,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:01:44,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} is VALID
[2022-04-08 10:01:44,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} ~z~0 := ~y~0; {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID
[2022-04-08 10:01:44,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID
[2022-04-08 10:01:44,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID
[2022-04-08 10:01:44,426 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:01:44,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:01:44,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID
[2022-04-08 10:01:44,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID
[2022-04-08 10:01:44,428 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-08 10:01:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:44,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796714240]
[2022-04-08 10:01:44,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796714240] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:44,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:44,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 10:01:44,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:01:44,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255712640]
[2022-04-08 10:01:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255712640] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:44,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:44,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 10:01:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601009798]
[2022-04-08 10:01:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:01:44,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14
[2022-04-08 10:01:44,440 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:01:44,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:44,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:44,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-08 10:01:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:44,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-08 10:01:44,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-04-08 10:01:44,478 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:44,871 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions.
[2022-04-08 10:01:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-04-08 10:01:44,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14
[2022-04-08 10:01:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:01:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions.
[2022-04-08 10:01:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions.
[2022-04-08 10:01:44,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions.
[2022-04-08 10:01:44,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:44,963 INFO L225 Difference]: With dead ends: 49
[2022-04-08 10:01:44,963 INFO L226 Difference]: Without dead ends: 16
[2022-04-08 10:01:44,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2022-04-08 10:01:44,967 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:01:44,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 10:01:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2022-04-08 10:01:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2022-04-08 10:01:44,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:01:44,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:44,985 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:44,986 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:44,987 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions.
[2022-04-08 10:01:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions.
[2022-04-08 10:01:44,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:44,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:44,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states.
[2022-04-08 10:01:44,988 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states.
[2022-04-08 10:01:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:44,989 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions.
[2022-04-08 10:01:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions.
[2022-04-08 10:01:44,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:44,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:44,990 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:01:44,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:01:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions.
[2022-04-08 10:01:44,992 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14
[2022-04-08 10:01:44,992 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:01:44,992 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions.
[2022-04-08 10:01:44,992 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:44,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions.
[2022-04-08 10:01:45,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions.
[2022-04-08 10:01:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-04-08 10:01:45,006 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:45,007 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:45,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 10:01:45,007 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 595464366, now seen corresponding path program 1 times
[2022-04-08 10:01:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:45,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427260359]
[2022-04-08 10:01:45,034 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:01:45,034 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:01:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash 595464366, now seen corresponding path program 2 times
[2022-04-08 10:01:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:45,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631017988]
[2022-04-08 10:01:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:45,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID
[2022-04-08 10:01:45,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID
[2022-04-08 10:01:45,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID
[2022-04-08 10:01:45,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:45,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID
[2022-04-08 10:01:45,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID
[2022-04-08 10:01:45,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID
[2022-04-08 10:01:45,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret11 := main(); {212#true} is VALID
[2022-04-08 10:01:45,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {217#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:45,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:45,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:45,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {219#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:01:45,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {213#false} is VALID
[2022-04-08 10:01:45,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !(~y~0 % 4294967296 > 0); {213#false} is VALID
[2022-04-08 10:01:45,123 INFO L272 TraceCheckUtils]: 11: Hoare triple {213#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213#false} is VALID
[2022-04-08 10:01:45,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID
[2022-04-08 10:01:45,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID
[2022-04-08 10:01:45,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID
[2022-04-08 10:01:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:45,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:45,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631017988]
[2022-04-08 10:01:45,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631017988] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:01:45,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702525185]
[2022-04-08 10:01:45,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:01:45,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:45,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:01:45,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-08 10:01:45,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:01:45,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:01:45,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 10:01:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:45,212 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:01:45,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID
[2022-04-08 10:01:45,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID
[2022-04-08 10:01:45,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID
[2022-04-08 10:01:45,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID
[2022-04-08 10:01:45,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret11 := main(); {212#true} is VALID
[2022-04-08 10:01:45,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {217#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:45,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:45,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:45,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {248#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:01:45,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {213#false} is VALID
[2022-04-08 10:01:45,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !(~y~0 % 4294967296 > 0); {213#false} is VALID
[2022-04-08 10:01:45,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {213#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213#false} is VALID
[2022-04-08 10:01:45,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID
[2022-04-08 10:01:45,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID
[2022-04-08 10:01:45,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID
[2022-04-08 10:01:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:45,464 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:01:45,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID
[2022-04-08 10:01:45,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID
[2022-04-08 10:01:45,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID
[2022-04-08 10:01:45,531 INFO L272 TraceCheckUtils]: 11: Hoare triple {213#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213#false} is VALID
[2022-04-08 10:01:45,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !(~y~0 % 4294967296 > 0); {213#false} is VALID
[2022-04-08 10:01:45,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {213#false} is VALID
[2022-04-08 10:01:45,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {286#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {282#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:01:45,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {286#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {286#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:45,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {286#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:45,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {293#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:01:45,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret11 := main(); {212#true} is VALID
[2022-04-08 10:01:45,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID
[2022-04-08 10:01:45,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID
[2022-04-08 10:01:45,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID
[2022-04-08 10:01:45,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID
[2022-04-08 10:01:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:45,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702525185] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:01:45,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:01:45,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10
[2022-04-08 10:01:45,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:01:45,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427260359]
[2022-04-08 10:01:45,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427260359] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:45,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:45,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 10:01:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14383977]
[2022-04-08 10:01:45,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:01:45,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15
[2022-04-08 10:01:45,537 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:01:45,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:45,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:45,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 10:01:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 10:01:45,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2022-04-08 10:01:45,549 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:45,695 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions.
[2022-04-08 10:01:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 10:01:45,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15
[2022-04-08 10:01:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:01:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions.
[2022-04-08 10:01:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions.
[2022-04-08 10:01:45,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions.
[2022-04-08 10:01:45,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:45,728 INFO L225 Difference]: With dead ends: 29
[2022-04-08 10:01:45,728 INFO L226 Difference]: Without dead ends: 23
[2022-04-08 10:01:45,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2022-04-08 10:01:45,730 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 10:01:45,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 10:01:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2022-04-08 10:01:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22.
[2022-04-08 10:01:45,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:01:45,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:45,746 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:45,747 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:45,748 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions.
[2022-04-08 10:01:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions.
[2022-04-08 10:01:45,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:45,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:45,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states.
[2022-04-08 10:01:45,756 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states.
[2022-04-08 10:01:45,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:45,757 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions.
[2022-04-08 10:01:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions.
[2022-04-08 10:01:45,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:45,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:45,758 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:01:45,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:01:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions.
[2022-04-08 10:01:45,762 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15
[2022-04-08 10:01:45,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:01:45,762 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions.
[2022-04-08 10:01:45,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:45,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions.
[2022-04-08 10:01:45,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions.
[2022-04-08 10:01:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2022-04-08 10:01:45,782 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:45,782 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:45,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-08 10:01:46,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:46,008 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2132382061, now seen corresponding path program 3 times
[2022-04-08 10:01:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:46,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [156668932]
[2022-04-08 10:01:46,012 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:01:46,012 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:01:46,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2132382061, now seen corresponding path program 4 times
[2022-04-08 10:01:46,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:46,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035044914]
[2022-04-08 10:01:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:46,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:46,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:46,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {468#true} is VALID
[2022-04-08 10:01:46,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} assume true; {468#true} is VALID
[2022-04-08 10:01:46,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {468#true} {468#true} #61#return; {468#true} is VALID
[2022-04-08 10:01:46,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {477#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:46,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {468#true} is VALID
[2022-04-08 10:01:46,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} assume true; {468#true} is VALID
[2022-04-08 10:01:46,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} #61#return; {468#true} is VALID
[2022-04-08 10:01:46,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} call #t~ret11 := main(); {468#true} is VALID
[2022-04-08 10:01:46,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {473#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:46,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {474#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:46,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:46,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:46,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {476#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:01:46,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {469#false} is VALID
[2022-04-08 10:01:46,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {469#false} assume !(~y~0 % 4294967296 > 0); {469#false} is VALID
[2022-04-08 10:01:46,106 INFO L272 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {469#false} is VALID
[2022-04-08 10:01:46,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID
[2022-04-08 10:01:46,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID
[2022-04-08 10:01:46,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID
[2022-04-08 10:01:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:46,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:46,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035044914]
[2022-04-08 10:01:46,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035044914] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:01:46,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625588751]
[2022-04-08 10:01:46,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:01:46,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:46,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:46,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:01:46,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-08 10:01:46,139 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:01:46,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:01:46,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-08 10:01:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:46,145 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:01:46,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID
[2022-04-08 10:01:46,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {468#true} is VALID
[2022-04-08 10:01:46,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} assume true; {468#true} is VALID
[2022-04-08 10:01:46,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} #61#return; {468#true} is VALID
[2022-04-08 10:01:46,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} call #t~ret11 := main(); {468#true} is VALID
[2022-04-08 10:01:46,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {473#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:46,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {474#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:46,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:46,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:46,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {508#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:01:46,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {469#false} is VALID
[2022-04-08 10:01:46,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {469#false} assume !(~y~0 % 4294967296 > 0); {469#false} is VALID
[2022-04-08 10:01:46,318 INFO L272 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {469#false} is VALID
[2022-04-08 10:01:46,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID
[2022-04-08 10:01:46,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID
[2022-04-08 10:01:46,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID
[2022-04-08 10:01:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:46,318 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:01:46,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID
[2022-04-08 10:01:46,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID
[2022-04-08 10:01:46,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID
[2022-04-08 10:01:46,417 INFO L272 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {469#false} is VALID
[2022-04-08 10:01:46,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {469#false} assume !(~y~0 % 4294967296 > 0); {469#false} is VALID
[2022-04-08 10:01:46,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {469#false} is VALID
[2022-04-08 10:01:46,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {542#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:01:46,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {546#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {546#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:46,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {546#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:46,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {557#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {553#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:01:46,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {557#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:01:46,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} call #t~ret11 := main(); {468#true} is VALID
[2022-04-08 10:01:46,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} #61#return; {468#true} is VALID
[2022-04-08 10:01:46,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} assume true; {468#true} is VALID
[2022-04-08 10:01:46,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {468#true} is VALID
[2022-04-08 10:01:46,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID
[2022-04-08 10:01:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:46,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625588751] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:01:46,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:01:46,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12
[2022-04-08 10:01:46,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:01:46,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [156668932]
[2022-04-08 10:01:46,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [156668932] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:46,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:46,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 10:01:46,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800580767]
[2022-04-08 10:01:46,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:01:46,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16
[2022-04-08 10:01:46,425 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:01:46,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:46,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:46,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-08 10:01:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:46,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-08 10:01:46,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2022-04-08 10:01:46,435 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:46,676 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions.
[2022-04-08 10:01:46,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 10:01:46,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16
[2022-04-08 10:01:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:01:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions.
[2022-04-08 10:01:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions.
[2022-04-08 10:01:46,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions.
[2022-04-08 10:01:46,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:46,714 INFO L225 Difference]: With dead ends: 36
[2022-04-08 10:01:46,714 INFO L226 Difference]: Without dead ends: 30
[2022-04-08 10:01:46,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2022-04-08 10:01:46,715 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:01:46,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 10:01:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2022-04-08 10:01:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27.
[2022-04-08 10:01:46,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:01:46,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:46,731 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:46,731 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:46,732 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions.
[2022-04-08 10:01:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions.
[2022-04-08 10:01:46,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:46,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:46,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states.
[2022-04-08 10:01:46,733 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states.
[2022-04-08 10:01:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:46,734 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions.
[2022-04-08 10:01:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions.
[2022-04-08 10:01:46,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:46,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:46,734 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:01:46,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:01:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions.
[2022-04-08 10:01:46,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16
[2022-04-08 10:01:46,736 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:01:46,736 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions.
[2022-04-08 10:01:46,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:46,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions.
[2022-04-08 10:01:46,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions.
[2022-04-08 10:01:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-08 10:01:46,764 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:46,764 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:46,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-08 10:01:46,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-08 10:01:46,980 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times
[2022-04-08 10:01:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:46,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [46126901]
[2022-04-08 10:01:46,984 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:01:46,984 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:01:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 2 times
[2022-04-08 10:01:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:46,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655712135]
[2022-04-08 10:01:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:46,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:47,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:47,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID
[2022-04-08 10:01:47,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID
[2022-04-08 10:01:47,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #61#return; {772#true} is VALID
[2022-04-08 10:01:47,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:47,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID
[2022-04-08 10:01:47,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID
[2022-04-08 10:01:47,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #61#return; {772#true} is VALID
[2022-04-08 10:01:47,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret11 := main(); {772#true} is VALID
[2022-04-08 10:01:47,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {777#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:01:47,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {778#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID
[2022-04-08 10:01:47,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {778#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {779#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID
[2022-04-08 10:01:47,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {779#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} ~z~0 := ~y~0; {780#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:47,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {780#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {781#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:47,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {781#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {781#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:47,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:47,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:47,251 INFO L272 TraceCheckUtils]: 13: Hoare triple {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {783#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:01:47,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {784#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:01:47,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {784#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {773#false} is VALID
[2022-04-08 10:01:47,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} assume !false; {773#false} is VALID
[2022-04-08 10:01:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:47,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655712135]
[2022-04-08 10:01:47,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655712135] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:01:47,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197806659]
[2022-04-08 10:01:47,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:01:47,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:47,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:47,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:01:47,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-08 10:01:47,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:01:47,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:01:47,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core
[2022-04-08 10:01:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:47,293 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:01:47,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID
[2022-04-08 10:01:47,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID
[2022-04-08 10:01:47,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID
[2022-04-08 10:01:47,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #61#return; {772#true} is VALID
[2022-04-08 10:01:47,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret11 := main(); {772#true} is VALID
[2022-04-08 10:01:47,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {777#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:01:47,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {807#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod main_~n~0 4294967296)))} is VALID
[2022-04-08 10:01:47,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {807#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod main_~n~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {811#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID
[2022-04-08 10:01:47,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} ~z~0 := ~y~0; {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID
[2022-04-08 10:01:47,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {819#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID
[2022-04-08 10:01:47,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {819#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {819#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID
[2022-04-08 10:01:47,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {819#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID
[2022-04-08 10:01:47,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID
[2022-04-08 10:01:47,636 INFO L272 TraceCheckUtils]: 13: Hoare triple {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:01:47,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {836#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:01:47,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {773#false} is VALID
[2022-04-08 10:01:47,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} assume !false; {773#false} is VALID
[2022-04-08 10:01:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:47,637 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:01:48,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} assume !false; {773#false} is VALID
[2022-04-08 10:01:48,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {773#false} is VALID
[2022-04-08 10:01:48,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {836#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:01:48,075 INFO L272 TraceCheckUtils]: 13: Hoare triple {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:01:48,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:48,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:48,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {858#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:48,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {865#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {858#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:48,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {869#(or (not (< 0 (mod main_~y~0 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {865#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID
[2022-04-08 10:01:48,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {869#(or (not (< 0 (mod main_~y~0 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:01:48,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {877#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {873#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:01:48,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {877#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:01:48,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret11 := main(); {772#true} is VALID
[2022-04-08 10:01:48,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #61#return; {772#true} is VALID
[2022-04-08 10:01:48,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID
[2022-04-08 10:01:48,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID
[2022-04-08 10:01:48,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID
[2022-04-08 10:01:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:48,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197806659] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:01:48,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:01:48,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22
[2022-04-08 10:01:48,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:01:48,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [46126901]
[2022-04-08 10:01:48,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [46126901] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:48,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:48,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-04-08 10:01:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912882782]
[2022-04-08 10:01:48,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:01:48,086 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17
[2022-04-08 10:01:48,086 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:01:48,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:48,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:48,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-04-08 10:01:48,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-04-08 10:01:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462
[2022-04-08 10:01:48,105 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:48,660 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions.
[2022-04-08 10:01:48,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-04-08 10:01:48,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17
[2022-04-08 10:01:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:01:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions.
[2022-04-08 10:01:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions.
[2022-04-08 10:01:48,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions.
[2022-04-08 10:01:48,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:48,699 INFO L225 Difference]: With dead ends: 36
[2022-04-08 10:01:48,699 INFO L226 Difference]: Without dead ends: 29
[2022-04-08 10:01:48,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870
[2022-04-08 10:01:48,701 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:01:48,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 10:01:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2022-04-08 10:01:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28.
[2022-04-08 10:01:48,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:01:48,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:48,727 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:48,727 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:48,728 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions.
[2022-04-08 10:01:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions.
[2022-04-08 10:01:48,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:48,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:48,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states.
[2022-04-08 10:01:48,729 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states.
[2022-04-08 10:01:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:48,730 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions.
[2022-04-08 10:01:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions.
[2022-04-08 10:01:48,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:48,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:48,730 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:01:48,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:01:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions.
[2022-04-08 10:01:48,731 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 17
[2022-04-08 10:01:48,731 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:01:48,731 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions.
[2022-04-08 10:01:48,731 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:48,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions.
[2022-04-08 10:01:48,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions.
[2022-04-08 10:01:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-08 10:01:48,768 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:48,768 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:48,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-04-08 10:01:48,968 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:48,969 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1762776946, now seen corresponding path program 5 times
[2022-04-08 10:01:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:48,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457698273]
[2022-04-08 10:01:48,973 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:01:48,973 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:01:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1762776946, now seen corresponding path program 6 times
[2022-04-08 10:01:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:48,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624961896]
[2022-04-08 10:01:48,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:49,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {1110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1100#true} is VALID
[2022-04-08 10:01:49,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID
[2022-04-08 10:01:49,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #61#return; {1100#true} is VALID
[2022-04-08 10:01:49,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:49,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1100#true} is VALID
[2022-04-08 10:01:49,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#true} assume true; {1100#true} is VALID
[2022-04-08 10:01:49,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1100#true} {1100#true} #61#return; {1100#true} is VALID
[2022-04-08 10:01:49,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {1100#true} call #t~ret11 := main(); {1100#true} is VALID
[2022-04-08 10:01:49,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {1100#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1105#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:49,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {1105#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1106#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:49,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {1106#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1107#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:49,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {1107#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:01:49,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:01:49,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1109#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:01:49,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {1109#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1101#false} is VALID
[2022-04-08 10:01:49,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#false} assume !(~y~0 % 4294967296 > 0); {1101#false} is VALID
[2022-04-08 10:01:49,053 INFO L272 TraceCheckUtils]: 13: Hoare triple {1101#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1101#false} is VALID
[2022-04-08 10:01:49,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID
[2022-04-08 10:01:49,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID
[2022-04-08 10:01:49,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {1101#false} assume !false; {1101#false} is VALID
[2022-04-08 10:01:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:49,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:49,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624961896]
[2022-04-08 10:01:49,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624961896] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:01:49,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697978735]
[2022-04-08 10:01:49,054 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:01:49,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:49,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:49,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:01:49,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-04-08 10:01:49,098 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s)
[2022-04-08 10:01:49,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:01:49,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-08 10:01:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:49,105 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:01:49,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID
[2022-04-08 10:01:49,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1100#true} is VALID
[2022-04-08 10:01:49,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#true} assume true; {1100#true} is VALID
[2022-04-08 10:01:49,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1100#true} {1100#true} #61#return; {1100#true} is VALID
[2022-04-08 10:01:49,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {1100#true} call #t~ret11 := main(); {1100#true} is VALID
[2022-04-08 10:01:49,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {1100#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1105#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:49,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {1105#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1106#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:49,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1106#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1107#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:49,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {1107#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:01:49,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:01:49,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1144#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:01:49,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {1144#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1101#false} is VALID
[2022-04-08 10:01:49,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#false} assume !(~y~0 % 4294967296 > 0); {1101#false} is VALID
[2022-04-08 10:01:49,265 INFO L272 TraceCheckUtils]: 13: Hoare triple {1101#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1101#false} is VALID
[2022-04-08 10:01:49,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID
[2022-04-08 10:01:49,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID
[2022-04-08 10:01:49,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {1101#false} assume !false; {1101#false} is VALID
[2022-04-08 10:01:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:49,266 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:01:49,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {1101#false} assume !false; {1101#false} is VALID
[2022-04-08 10:01:49,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID
[2022-04-08 10:01:49,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID
[2022-04-08 10:01:49,377 INFO L272 TraceCheckUtils]: 13: Hoare triple {1101#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1101#false} is VALID
[2022-04-08 10:01:49,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#false} assume !(~y~0 % 4294967296 > 0); {1101#false} is VALID
[2022-04-08 10:01:49,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1101#false} is VALID
[2022-04-08 10:01:49,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1178#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:01:49,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {1182#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1182#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:49,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {1189#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1182#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:49,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1189#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:01:49,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {1197#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1193#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:01:49,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {1100#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1197#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:01:49,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {1100#true} call #t~ret11 := main(); {1100#true} is VALID
[2022-04-08 10:01:49,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1100#true} {1100#true} #61#return; {1100#true} is VALID
[2022-04-08 10:01:49,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#true} assume true; {1100#true} is VALID
[2022-04-08 10:01:49,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1100#true} is VALID
[2022-04-08 10:01:49,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID
[2022-04-08 10:01:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:49,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697978735] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:01:49,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:01:49,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14
[2022-04-08 10:01:49,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:01:49,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457698273]
[2022-04-08 10:01:49,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457698273] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:49,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:49,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 10:01:49,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206228424]
[2022-04-08 10:01:49,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:01:49,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17
[2022-04-08 10:01:49,384 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:01:49,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:49,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:49,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-08 10:01:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:49,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-08 10:01:49,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182
[2022-04-08 10:01:49,393 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:49,681 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions.
[2022-04-08 10:01:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 10:01:49,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17
[2022-04-08 10:01:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:01:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions.
[2022-04-08 10:01:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions.
[2022-04-08 10:01:49,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 50 transitions.
[2022-04-08 10:01:49,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:49,719 INFO L225 Difference]: With dead ends: 43
[2022-04-08 10:01:49,719 INFO L226 Difference]: Without dead ends: 37
[2022-04-08 10:01:49,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342
[2022-04-08 10:01:49,720 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:01:49,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 10:01:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2022-04-08 10:01:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33.
[2022-04-08 10:01:49,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:01:49,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:49,766 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:49,766 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:49,768 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions.
[2022-04-08 10:01:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions.
[2022-04-08 10:01:49,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:49,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:49,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states.
[2022-04-08 10:01:49,768 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states.
[2022-04-08 10:01:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:49,769 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions.
[2022-04-08 10:01:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions.
[2022-04-08 10:01:49,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:49,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:49,770 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:01:49,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:01:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions.
[2022-04-08 10:01:49,770 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17
[2022-04-08 10:01:49,771 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:01:49,771 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions.
[2022-04-08 10:01:49,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:49,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 41 transitions.
[2022-04-08 10:01:49,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions.
[2022-04-08 10:01:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2022-04-08 10:01:49,830 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:49,830 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:49,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-04-08 10:01:50,030 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:50,030 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 3 times
[2022-04-08 10:01:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:50,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [176853288]
[2022-04-08 10:01:50,034 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:01:50,034 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:01:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 4 times
[2022-04-08 10:01:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:50,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801543059]
[2022-04-08 10:01:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:50,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:50,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {1463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1454#true} is VALID
[2022-04-08 10:01:50,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {1454#true} assume true; {1454#true} is VALID
[2022-04-08 10:01:50,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1454#true} {1454#true} #61#return; {1454#true} is VALID
[2022-04-08 10:01:50,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:50,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {1463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1454#true} is VALID
[2022-04-08 10:01:50,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID
[2022-04-08 10:01:50,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #61#return; {1454#true} is VALID
[2022-04-08 10:01:50,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret11 := main(); {1454#true} is VALID
[2022-04-08 10:01:50,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {1454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1459#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:50,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {1459#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:50,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:50,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1461#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:01:50,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {1461#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1462#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID
[2022-04-08 10:01:50,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {1462#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1455#false} is VALID
[2022-04-08 10:01:50,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {1455#false} assume !(~z~0 % 4294967296 > 0); {1455#false} is VALID
[2022-04-08 10:01:50,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {1455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1455#false} is VALID
[2022-04-08 10:01:50,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {1455#false} assume !(~y~0 % 4294967296 > 0); {1455#false} is VALID
[2022-04-08 10:01:50,104 INFO L272 TraceCheckUtils]: 14: Hoare triple {1455#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1455#false} is VALID
[2022-04-08 10:01:50,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {1455#false} ~cond := #in~cond; {1455#false} is VALID
[2022-04-08 10:01:50,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {1455#false} assume 0 == ~cond; {1455#false} is VALID
[2022-04-08 10:01:50,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {1455#false} assume !false; {1455#false} is VALID
[2022-04-08 10:01:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 10:01:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801543059]
[2022-04-08 10:01:50,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801543059] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:01:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136827239]
[2022-04-08 10:01:50,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:01:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:50,106 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:01:50,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-04-08 10:01:50,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:01:50,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:01:50,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core
[2022-04-08 10:01:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:50,159 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:01:50,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID
[2022-04-08 10:01:50,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1454#true} is VALID
[2022-04-08 10:01:50,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID
[2022-04-08 10:01:50,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #61#return; {1454#true} is VALID
[2022-04-08 10:01:50,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret11 := main(); {1454#true} is VALID
[2022-04-08 10:01:50,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {1454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1459#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:50,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {1459#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:50,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:50,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1491#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:50,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {1491#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1495#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:50,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {1495#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1455#false} is VALID
[2022-04-08 10:01:50,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {1455#false} assume !(~z~0 % 4294967296 > 0); {1455#false} is VALID
[2022-04-08 10:01:50,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {1455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1455#false} is VALID
[2022-04-08 10:01:50,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {1455#false} assume !(~y~0 % 4294967296 > 0); {1455#false} is VALID
[2022-04-08 10:01:50,233 INFO L272 TraceCheckUtils]: 14: Hoare triple {1455#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1455#false} is VALID
[2022-04-08 10:01:50,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {1455#false} ~cond := #in~cond; {1455#false} is VALID
[2022-04-08 10:01:50,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {1455#false} assume 0 == ~cond; {1455#false} is VALID
[2022-04-08 10:01:50,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {1455#false} assume !false; {1455#false} is VALID
[2022-04-08 10:01:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 10:01:50,234 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:01:50,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {1455#false} assume !false; {1455#false} is VALID
[2022-04-08 10:01:50,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {1455#false} assume 0 == ~cond; {1455#false} is VALID
[2022-04-08 10:01:50,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {1455#false} ~cond := #in~cond; {1455#false} is VALID
[2022-04-08 10:01:50,328 INFO L272 TraceCheckUtils]: 14: Hoare triple {1455#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1455#false} is VALID
[2022-04-08 10:01:50,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {1532#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1455#false} is VALID
[2022-04-08 10:01:50,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {1536#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1532#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:50,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1536#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:01:50,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {1543#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1536#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:01:50,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {1547#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1543#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID
[2022-04-08 10:01:50,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {1454#true} ~z~0 := ~y~0; {1547#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:01:50,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {1454#true} assume !(~x~0 % 4294967296 > 0); {1454#true} is VALID
[2022-04-08 10:01:50,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {1454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1454#true} is VALID
[2022-04-08 10:01:50,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {1454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1454#true} is VALID
[2022-04-08 10:01:50,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret11 := main(); {1454#true} is VALID
[2022-04-08 10:01:50,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #61#return; {1454#true} is VALID
[2022-04-08 10:01:50,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID
[2022-04-08 10:01:50,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1454#true} is VALID
[2022-04-08 10:01:50,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID
[2022-04-08 10:01:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-08 10:01:50,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136827239] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:01:50,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:01:50,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13
[2022-04-08 10:01:50,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:01:50,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [176853288]
[2022-04-08 10:01:50,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [176853288] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:50,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:50,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 10:01:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652018153]
[2022-04-08 10:01:50,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:01:50,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18
[2022-04-08 10:01:50,336 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:01:50,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:50,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:50,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-08 10:01:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:50,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-08 10:01:50,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156
[2022-04-08 10:01:50,348 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:50,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:50,503 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions.
[2022-04-08 10:01:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 10:01:50,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18
[2022-04-08 10:01:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:01:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions.
[2022-04-08 10:01:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions.
[2022-04-08 10:01:50,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions.
[2022-04-08 10:01:50,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:50,530 INFO L225 Difference]: With dead ends: 40
[2022-04-08 10:01:50,531 INFO L226 Difference]: Without dead ends: 29
[2022-04-08 10:01:50,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272
[2022-04-08 10:01:50,531 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 10:01:50,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 10:01:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2022-04-08 10:01:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2022-04-08 10:01:50,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:01:50,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:50,550 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:50,550 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:50,551 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions.
[2022-04-08 10:01:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions.
[2022-04-08 10:01:50,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:50,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:50,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states.
[2022-04-08 10:01:50,551 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states.
[2022-04-08 10:01:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:50,552 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions.
[2022-04-08 10:01:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions.
[2022-04-08 10:01:50,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:50,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:50,552 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:01:50,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:01:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions.
[2022-04-08 10:01:50,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18
[2022-04-08 10:01:50,553 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:01:50,553 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions.
[2022-04-08 10:01:50,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:50,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions.
[2022-04-08 10:01:50,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions.
[2022-04-08 10:01:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2022-04-08 10:01:50,585 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:50,585 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:50,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2022-04-08 10:01:50,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:50,800 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:50,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:50,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2041345421, now seen corresponding path program 7 times
[2022-04-08 10:01:50,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:50,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661288282]
[2022-04-08 10:01:50,803 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:01:50,803 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:01:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2041345421, now seen corresponding path program 8 times
[2022-04-08 10:01:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:50,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353330197]
[2022-04-08 10:01:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:50,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:50,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1781#true} is VALID
[2022-04-08 10:01:50,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {1781#true} assume true; {1781#true} is VALID
[2022-04-08 10:01:50,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1781#true} {1781#true} #61#return; {1781#true} is VALID
[2022-04-08 10:01:50,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {1781#true} call ULTIMATE.init(); {1792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:50,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1781#true} is VALID
[2022-04-08 10:01:50,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {1781#true} assume true; {1781#true} is VALID
[2022-04-08 10:01:50,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1781#true} {1781#true} #61#return; {1781#true} is VALID
[2022-04-08 10:01:50,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {1781#true} call #t~ret11 := main(); {1781#true} is VALID
[2022-04-08 10:01:50,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {1781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1786#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:50,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {1786#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1787#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:50,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:50,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {1788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1789#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:01:50,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:01:50,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:01:50,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1791#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:01:50,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {1791#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1782#false} is VALID
[2022-04-08 10:01:50,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#false} assume !(~y~0 % 4294967296 > 0); {1782#false} is VALID
[2022-04-08 10:01:50,915 INFO L272 TraceCheckUtils]: 14: Hoare triple {1782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1782#false} is VALID
[2022-04-08 10:01:50,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {1782#false} ~cond := #in~cond; {1782#false} is VALID
[2022-04-08 10:01:50,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#false} assume 0 == ~cond; {1782#false} is VALID
[2022-04-08 10:01:50,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#false} assume !false; {1782#false} is VALID
[2022-04-08 10:01:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:50,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353330197]
[2022-04-08 10:01:50,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353330197] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:01:50,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425767137]
[2022-04-08 10:01:50,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:01:50,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:50,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:50,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:01:50,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-04-08 10:01:50,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:01:50,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:01:50,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core
[2022-04-08 10:01:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:50,951 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:01:51,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {1781#true} call ULTIMATE.init(); {1781#true} is VALID
[2022-04-08 10:01:51,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1781#true} is VALID
[2022-04-08 10:01:51,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {1781#true} assume true; {1781#true} is VALID
[2022-04-08 10:01:51,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1781#true} {1781#true} #61#return; {1781#true} is VALID
[2022-04-08 10:01:51,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {1781#true} call #t~ret11 := main(); {1781#true} is VALID
[2022-04-08 10:01:51,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {1781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1786#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:51,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {1786#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1787#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:51,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:51,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {1788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1789#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:01:51,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:01:51,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:01:51,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1829#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:01:51,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {1829#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {1782#false} is VALID
[2022-04-08 10:01:51,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#false} assume !(~y~0 % 4294967296 > 0); {1782#false} is VALID
[2022-04-08 10:01:51,117 INFO L272 TraceCheckUtils]: 14: Hoare triple {1782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1782#false} is VALID
[2022-04-08 10:01:51,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {1782#false} ~cond := #in~cond; {1782#false} is VALID
[2022-04-08 10:01:51,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#false} assume 0 == ~cond; {1782#false} is VALID
[2022-04-08 10:01:51,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#false} assume !false; {1782#false} is VALID
[2022-04-08 10:01:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:51,117 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:01:51,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#false} assume !false; {1782#false} is VALID
[2022-04-08 10:01:51,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#false} assume 0 == ~cond; {1782#false} is VALID
[2022-04-08 10:01:51,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {1782#false} ~cond := #in~cond; {1782#false} is VALID
[2022-04-08 10:01:51,225 INFO L272 TraceCheckUtils]: 14: Hoare triple {1782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1782#false} is VALID
[2022-04-08 10:01:51,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#false} assume !(~y~0 % 4294967296 > 0); {1782#false} is VALID
[2022-04-08 10:01:51,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1782#false} is VALID
[2022-04-08 10:01:51,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {1867#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1863#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:01:51,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {1867#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1867#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:51,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {1874#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1867#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:51,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {1878#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1874#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:01:51,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {1882#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1878#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:01:51,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {1886#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1882#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:01:51,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {1781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1886#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:01:51,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {1781#true} call #t~ret11 := main(); {1781#true} is VALID
[2022-04-08 10:01:51,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1781#true} {1781#true} #61#return; {1781#true} is VALID
[2022-04-08 10:01:51,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {1781#true} assume true; {1781#true} is VALID
[2022-04-08 10:01:51,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {1781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1781#true} is VALID
[2022-04-08 10:01:51,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {1781#true} call ULTIMATE.init(); {1781#true} is VALID
[2022-04-08 10:01:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:51,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425767137] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:01:51,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:01:51,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16
[2022-04-08 10:01:51,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:01:51,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661288282]
[2022-04-08 10:01:51,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661288282] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:51,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:51,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-04-08 10:01:51,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150740733]
[2022-04-08 10:01:51,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:01:51,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18
[2022-04-08 10:01:51,231 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:01:51,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:51,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:51,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-04-08 10:01:51,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:51,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-04-08 10:01:51,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240
[2022-04-08 10:01:51,241 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:51,561 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions.
[2022-04-08 10:01:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-04-08 10:01:51,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18
[2022-04-08 10:01:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:01:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions.
[2022-04-08 10:01:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions.
[2022-04-08 10:01:51,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 53 transitions.
[2022-04-08 10:01:51,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:51,604 INFO L225 Difference]: With dead ends: 45
[2022-04-08 10:01:51,604 INFO L226 Difference]: Without dead ends: 39
[2022-04-08 10:01:51,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462
[2022-04-08 10:01:51,605 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:01:51,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 50 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 10:01:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2022-04-08 10:01:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34.
[2022-04-08 10:01:51,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:01:51,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:51,628 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:51,628 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:51,629 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions.
[2022-04-08 10:01:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions.
[2022-04-08 10:01:51,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:51,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:51,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states.
[2022-04-08 10:01:51,630 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states.
[2022-04-08 10:01:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:51,631 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions.
[2022-04-08 10:01:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions.
[2022-04-08 10:01:51,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:51,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:51,631 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:01:51,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:01:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions.
[2022-04-08 10:01:51,632 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 18
[2022-04-08 10:01:51,632 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:01:51,632 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions.
[2022-04-08 10:01:51,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:51,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions.
[2022-04-08 10:01:51,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions.
[2022-04-08 10:01:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2022-04-08 10:01:51,669 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:51,669 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:51,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2022-04-08 10:01:51,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:51,884 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:51,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1675054353, now seen corresponding path program 5 times
[2022-04-08 10:01:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:51,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721635281]
[2022-04-08 10:01:51,886 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:01:51,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:01:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1675054353, now seen corresponding path program 6 times
[2022-04-08 10:01:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:51,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545695971]
[2022-04-08 10:01:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:51,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:51,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {2165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID
[2022-04-08 10:01:51,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID
[2022-04-08 10:01:51,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID
[2022-04-08 10:01:51,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:51,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {2165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID
[2022-04-08 10:01:51,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID
[2022-04-08 10:01:51,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID
[2022-04-08 10:01:51,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret11 := main(); {2155#true} is VALID
[2022-04-08 10:01:51,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2160#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:51,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2161#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:51,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:51,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:51,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2163#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:01:51,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {2163#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2164#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:01:51,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {2164#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2156#false} is VALID
[2022-04-08 10:01:51,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID
[2022-04-08 10:01:51,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID
[2022-04-08 10:01:51,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#false} assume !(~y~0 % 4294967296 > 0); {2156#false} is VALID
[2022-04-08 10:01:51,993 INFO L272 TraceCheckUtils]: 15: Hoare triple {2156#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2156#false} is VALID
[2022-04-08 10:01:51,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID
[2022-04-08 10:01:51,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID
[2022-04-08 10:01:51,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#false} assume !false; {2156#false} is VALID
[2022-04-08 10:01:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2022-04-08 10:01:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:51,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545695971]
[2022-04-08 10:01:51,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545695971] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:01:51,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565922986]
[2022-04-08 10:01:51,994 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:01:51,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:51,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:51,995 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:01:51,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2022-04-08 10:01:52,024 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2022-04-08 10:01:52,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:01:52,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core
[2022-04-08 10:01:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:52,031 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:01:52,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID
[2022-04-08 10:01:52,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID
[2022-04-08 10:01:52,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID
[2022-04-08 10:01:52,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID
[2022-04-08 10:01:52,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret11 := main(); {2155#true} is VALID
[2022-04-08 10:01:52,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2160#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:52,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2161#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:52,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:52,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:52,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2196#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:52,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {2196#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2200#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:01:52,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {2200#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2156#false} is VALID
[2022-04-08 10:01:52,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID
[2022-04-08 10:01:52,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID
[2022-04-08 10:01:52,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#false} assume !(~y~0 % 4294967296 > 0); {2156#false} is VALID
[2022-04-08 10:01:52,113 INFO L272 TraceCheckUtils]: 15: Hoare triple {2156#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2156#false} is VALID
[2022-04-08 10:01:52,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID
[2022-04-08 10:01:52,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID
[2022-04-08 10:01:52,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#false} assume !false; {2156#false} is VALID
[2022-04-08 10:01:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2022-04-08 10:01:52,113 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:01:52,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#false} assume !false; {2156#false} is VALID
[2022-04-08 10:01:52,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID
[2022-04-08 10:01:52,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID
[2022-04-08 10:01:52,213 INFO L272 TraceCheckUtils]: 15: Hoare triple {2156#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2156#false} is VALID
[2022-04-08 10:01:52,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#false} assume !(~y~0 % 4294967296 > 0); {2156#false} is VALID
[2022-04-08 10:01:52,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {2240#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID
[2022-04-08 10:01:52,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {2244#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2240#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:01:52,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {2248#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2244#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:01:52,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {2252#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2248#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID
[2022-04-08 10:01:52,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} ~z~0 := ~y~0; {2252#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID
[2022-04-08 10:01:52,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(~x~0 % 4294967296 > 0); {2155#true} is VALID
[2022-04-08 10:01:52,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2155#true} is VALID
[2022-04-08 10:01:52,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {2155#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2155#true} is VALID
[2022-04-08 10:01:52,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2155#true} is VALID
[2022-04-08 10:01:52,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret11 := main(); {2155#true} is VALID
[2022-04-08 10:01:52,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID
[2022-04-08 10:01:52,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID
[2022-04-08 10:01:52,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID
[2022-04-08 10:01:52,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID
[2022-04-08 10:01:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2022-04-08 10:01:52,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565922986] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:01:52,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:01:52,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14
[2022-04-08 10:01:52,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:01:52,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721635281]
[2022-04-08 10:01:52,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721635281] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:52,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:52,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 10:01:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079164973]
[2022-04-08 10:01:52,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:01:52,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19
[2022-04-08 10:01:52,219 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:01:52,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:52,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:52,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-08 10:01:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:52,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-08 10:01:52,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182
[2022-04-08 10:01:52,232 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:52,443 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions.
[2022-04-08 10:01:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 10:01:52,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19
[2022-04-08 10:01:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:01:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions.
[2022-04-08 10:01:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions.
[2022-04-08 10:01:52,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions.
[2022-04-08 10:01:52,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:52,473 INFO L225 Difference]: With dead ends: 47
[2022-04-08 10:01:52,473 INFO L226 Difference]: Without dead ends: 39
[2022-04-08 10:01:52,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2022-04-08 10:01:52,474 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:01:52,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 10:01:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2022-04-08 10:01:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35.
[2022-04-08 10:01:52,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:01:52,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:52,500 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:52,500 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:52,501 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions.
[2022-04-08 10:01:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions.
[2022-04-08 10:01:52,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:52,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:52,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states.
[2022-04-08 10:01:52,501 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states.
[2022-04-08 10:01:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:52,502 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions.
[2022-04-08 10:01:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions.
[2022-04-08 10:01:52,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:52,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:52,502 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:01:52,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:01:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions.
[2022-04-08 10:01:52,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 19
[2022-04-08 10:01:52,503 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:01:52,503 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions.
[2022-04-08 10:01:52,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:52,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 43 transitions.
[2022-04-08 10:01:52,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions.
[2022-04-08 10:01:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2022-04-08 10:01:52,540 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:52,540 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:52,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2022-04-08 10:01:52,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:52,741 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -289945490, now seen corresponding path program 9 times
[2022-04-08 10:01:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:52,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1061038134]
[2022-04-08 10:01:52,743 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:01:52,743 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:01:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -289945490, now seen corresponding path program 10 times
[2022-04-08 10:01:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62601183]
[2022-04-08 10:01:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:52,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {2549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID
[2022-04-08 10:01:52,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} assume true; {2537#true} is VALID
[2022-04-08 10:01:52,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2537#true} {2537#true} #61#return; {2537#true} is VALID
[2022-04-08 10:01:52,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:52,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID
[2022-04-08 10:01:52,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID
[2022-04-08 10:01:52,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #61#return; {2537#true} is VALID
[2022-04-08 10:01:52,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret11 := main(); {2537#true} is VALID
[2022-04-08 10:01:52,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2542#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:52,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {2542#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:52,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:52,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {2544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:01:52,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {2545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:01:52,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {2546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:01:52,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:01:52,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {2548#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:01:52,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {2548#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2538#false} is VALID
[2022-04-08 10:01:52,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#false} assume !(~y~0 % 4294967296 > 0); {2538#false} is VALID
[2022-04-08 10:01:52,838 INFO L272 TraceCheckUtils]: 15: Hoare triple {2538#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2538#false} is VALID
[2022-04-08 10:01:52,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#false} ~cond := #in~cond; {2538#false} is VALID
[2022-04-08 10:01:52,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#false} assume 0 == ~cond; {2538#false} is VALID
[2022-04-08 10:01:52,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {2538#false} assume !false; {2538#false} is VALID
[2022-04-08 10:01:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:52,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:52,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62601183]
[2022-04-08 10:01:52,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62601183] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:01:52,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553744480]
[2022-04-08 10:01:52,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:01:52,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:52,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:52,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:01:52,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2022-04-08 10:01:52,877 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:01:52,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:01:52,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core
[2022-04-08 10:01:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:52,882 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:01:53,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2537#true} is VALID
[2022-04-08 10:01:53,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID
[2022-04-08 10:01:53,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID
[2022-04-08 10:01:53,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #61#return; {2537#true} is VALID
[2022-04-08 10:01:53,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret11 := main(); {2537#true} is VALID
[2022-04-08 10:01:53,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2542#(= main_~y~0 0)} is VALID
[2022-04-08 10:01:53,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {2542#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:53,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:53,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {2544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:01:53,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {2545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:01:53,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {2546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:01:53,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:01:53,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {2589#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:01:53,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {2589#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2538#false} is VALID
[2022-04-08 10:01:53,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#false} assume !(~y~0 % 4294967296 > 0); {2538#false} is VALID
[2022-04-08 10:01:53,046 INFO L272 TraceCheckUtils]: 15: Hoare triple {2538#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2538#false} is VALID
[2022-04-08 10:01:53,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#false} ~cond := #in~cond; {2538#false} is VALID
[2022-04-08 10:01:53,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#false} assume 0 == ~cond; {2538#false} is VALID
[2022-04-08 10:01:53,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {2538#false} assume !false; {2538#false} is VALID
[2022-04-08 10:01:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:53,047 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:01:53,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {2538#false} assume !false; {2538#false} is VALID
[2022-04-08 10:01:53,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#false} assume 0 == ~cond; {2538#false} is VALID
[2022-04-08 10:01:53,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#false} ~cond := #in~cond; {2538#false} is VALID
[2022-04-08 10:01:53,196 INFO L272 TraceCheckUtils]: 15: Hoare triple {2538#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2538#false} is VALID
[2022-04-08 10:01:53,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#false} assume !(~y~0 % 4294967296 > 0); {2538#false} is VALID
[2022-04-08 10:01:53,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {2623#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2538#false} is VALID
[2022-04-08 10:01:53,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {2627#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {2623#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:01:53,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {2627#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2627#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:53,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {2634#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2627#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:01:53,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {2638#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2634#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:01:53,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {2642#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2638#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:01:53,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {2646#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2642#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:01:53,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {2650#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2646#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:01:53,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2650#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:01:53,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret11 := main(); {2537#true} is VALID
[2022-04-08 10:01:53,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #61#return; {2537#true} is VALID
[2022-04-08 10:01:53,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID
[2022-04-08 10:01:53,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID
[2022-04-08 10:01:53,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2537#true} is VALID
[2022-04-08 10:01:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:53,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553744480] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:01:53,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:01:53,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18
[2022-04-08 10:01:53,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:01:53,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1061038134]
[2022-04-08 10:01:53,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1061038134] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:01:53,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:01:53,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-08 10:01:53,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670579760]
[2022-04-08 10:01:53,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:01:53,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19
[2022-04-08 10:01:53,206 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:01:53,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:53,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:53,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-08 10:01:53,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:53,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-08 10:01:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306
[2022-04-08 10:01:53,219 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:53,698 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions.
[2022-04-08 10:01:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-08 10:01:53,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19
[2022-04-08 10:01:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:01:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions.
[2022-04-08 10:01:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions.
[2022-04-08 10:01:53,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 60 transitions.
[2022-04-08 10:01:53,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:53,774 INFO L225 Difference]: With dead ends: 52
[2022-04-08 10:01:53,774 INFO L226 Difference]: Without dead ends: 46
[2022-04-08 10:01:53,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600
[2022-04-08 10:01:53,775 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:01:53,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 58 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:01:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2022-04-08 10:01:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40.
[2022-04-08 10:01:53,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:01:53,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:53,807 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:53,807 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:53,808 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions.
[2022-04-08 10:01:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions.
[2022-04-08 10:01:53,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:53,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:53,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states.
[2022-04-08 10:01:53,808 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states.
[2022-04-08 10:01:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:01:53,809 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions.
[2022-04-08 10:01:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions.
[2022-04-08 10:01:53,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:01:53,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:01:53,810 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:01:53,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:01:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions.
[2022-04-08 10:01:53,811 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 19
[2022-04-08 10:01:53,811 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:01:53,811 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions.
[2022-04-08 10:01:53,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:01:53,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 50 transitions.
[2022-04-08 10:01:53,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:01:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions.
[2022-04-08 10:01:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-08 10:01:53,864 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:01:53,864 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:01:53,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2022-04-08 10:01:54,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2022-04-08 10:01:54,080 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:01:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:01:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 7 times
[2022-04-08 10:01:54,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:01:54,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1209432494]
[2022-04-08 10:01:54,083 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:01:54,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:01:54,083 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 8 times
[2022-04-08 10:01:54,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:01:54,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351091099]
[2022-04-08 10:01:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:01:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:01:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:54,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:01:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:54,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {2976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2961#true} is VALID
[2022-04-08 10:01:54,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2961#true} assume true; {2961#true} is VALID
[2022-04-08 10:01:54,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2961#true} {2961#true} #61#return; {2961#true} is VALID
[2022-04-08 10:01:54,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {2961#true} call ULTIMATE.init(); {2976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:01:54,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {2976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2961#true} is VALID
[2022-04-08 10:01:54,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {2961#true} assume true; {2961#true} is VALID
[2022-04-08 10:01:54,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2961#true} {2961#true} #61#return; {2961#true} is VALID
[2022-04-08 10:01:54,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {2961#true} call #t~ret11 := main(); {2961#true} is VALID
[2022-04-08 10:01:54,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {2961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2966#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:01:54,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {2966#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2967#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:01:54,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {2967#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2968#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID
[2022-04-08 10:01:54,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {2968#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {2969#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:01:54,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {2969#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:01:54,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID
[2022-04-08 10:01:54,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID
[2022-04-08 10:01:54,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID
[2022-04-08 10:01:54,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID
[2022-04-08 10:01:54,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:54,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:01:54,389 INFO L272 TraceCheckUtils]: 16: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2974#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:01:54,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {2974#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2975#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:01:54,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {2975#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2962#false} is VALID
[2022-04-08 10:01:54,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#false} assume !false; {2962#false} is VALID
[2022-04-08 10:01:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:01:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:01:54,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351091099]
[2022-04-08 10:01:54,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351091099] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:01:54,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465172646]
[2022-04-08 10:01:54,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:01:54,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:01:54,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:01:54,392 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:01:54,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2022-04-08 10:01:54,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:01:54,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:01:54,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 27 conjunts are in the unsatisfiable core
[2022-04-08 10:01:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:01:54,446 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:02:18,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {2961#true} call ULTIMATE.init(); {2961#true} is VALID
[2022-04-08 10:02:18,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {2961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2961#true} is VALID
[2022-04-08 10:02:18,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {2961#true} assume true; {2961#true} is VALID
[2022-04-08 10:02:18,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2961#true} {2961#true} #61#return; {2961#true} is VALID
[2022-04-08 10:02:18,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {2961#true} call #t~ret11 := main(); {2961#true} is VALID
[2022-04-08 10:02:18,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {2961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2966#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:02:18,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {2966#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2998#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID
[2022-04-08 10:02:18,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {2998#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3002#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID
[2022-04-08 10:02:18,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {3002#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {2969#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:18,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {2969#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:02:18,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID
[2022-04-08 10:02:18,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID
[2022-04-08 10:02:18,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID
[2022-04-08 10:02:18,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID
[2022-04-08 10:02:18,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:02:18,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:02:18,982 INFO L272 TraceCheckUtils]: 16: Hoare triple {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:02:18,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {3030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3034#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:02:18,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {3034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2962#false} is VALID
[2022-04-08 10:02:18,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#false} assume !false; {2962#false} is VALID
[2022-04-08 10:02:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:18,983 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:02:19,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#false} assume !false; {2962#false} is VALID
[2022-04-08 10:02:19,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {3034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2962#false} is VALID
[2022-04-08 10:02:19,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {3030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3034#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:02:19,497 INFO L272 TraceCheckUtils]: 16: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:02:19,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:19,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {3056#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:19,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3060#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3056#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:19,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {3060#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {3060#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:02:19,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {3056#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3060#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:02:19,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3056#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:19,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {3073#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:19,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {3077#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {3073#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:02:19,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {3081#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3077#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:02:19,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {3085#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3081#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:02:19,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {2961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3085#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:02:19,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {2961#true} call #t~ret11 := main(); {2961#true} is VALID
[2022-04-08 10:02:19,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2961#true} {2961#true} #61#return; {2961#true} is VALID
[2022-04-08 10:02:19,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {2961#true} assume true; {2961#true} is VALID
[2022-04-08 10:02:19,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {2961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2961#true} is VALID
[2022-04-08 10:02:19,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {2961#true} call ULTIMATE.init(); {2961#true} is VALID
[2022-04-08 10:02:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:19,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465172646] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:02:19,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:02:19,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23
[2022-04-08 10:02:19,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:02:19,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1209432494]
[2022-04-08 10:02:19,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1209432494] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:02:19,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:02:19,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-04-08 10:02:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130007229]
[2022-04-08 10:02:19,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:02:19,512 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2022-04-08 10:02:19,513 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:02:19,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:19,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:19,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-04-08 10:02:19,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:19,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-04-08 10:02:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506
[2022-04-08 10:02:19,535 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:20,203 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions.
[2022-04-08 10:02:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-04-08 10:02:20,203 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2022-04-08 10:02:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:02:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions.
[2022-04-08 10:02:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions.
[2022-04-08 10:02:20,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 40 transitions.
[2022-04-08 10:02:20,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:20,272 INFO L225 Difference]: With dead ends: 55
[2022-04-08 10:02:20,272 INFO L226 Difference]: Without dead ends: 36
[2022-04-08 10:02:20,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122
[2022-04-08 10:02:20,273 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:02:20,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 57 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:02:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2022-04-08 10:02:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2022-04-08 10:02:20,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:02:20,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:20,310 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:20,312 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:20,313 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions.
[2022-04-08 10:02:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions.
[2022-04-08 10:02:20,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:20,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:20,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states.
[2022-04-08 10:02:20,315 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states.
[2022-04-08 10:02:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:20,315 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions.
[2022-04-08 10:02:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions.
[2022-04-08 10:02:20,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:20,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:20,316 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:02:20,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:02:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions.
[2022-04-08 10:02:20,316 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 20
[2022-04-08 10:02:20,317 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:02:20,317 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions.
[2022-04-08 10:02:20,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:20,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions.
[2022-04-08 10:02:20,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions.
[2022-04-08 10:02:20,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-08 10:02:20,452 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:02:20,452 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:02:20,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2022-04-08 10:02:20,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2022-04-08 10:02:20,659 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:02:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:02:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 454480301, now seen corresponding path program 11 times
[2022-04-08 10:02:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:20,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820621057]
[2022-04-08 10:02:20,662 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:02:20,662 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:02:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 454480301, now seen corresponding path program 12 times
[2022-04-08 10:02:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:02:20,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769668763]
[2022-04-08 10:02:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:02:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:02:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:20,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:02:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:20,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {3395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3382#true} is VALID
[2022-04-08 10:02:20,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {3382#true} assume true; {3382#true} is VALID
[2022-04-08 10:02:20,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3382#true} {3382#true} #61#return; {3382#true} is VALID
[2022-04-08 10:02:20,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:02:20,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {3395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3382#true} is VALID
[2022-04-08 10:02:20,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID
[2022-04-08 10:02:20,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #61#return; {3382#true} is VALID
[2022-04-08 10:02:20,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret11 := main(); {3382#true} is VALID
[2022-04-08 10:02:20,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {3382#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3387#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:20,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {3387#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3388#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:20,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {3388#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3389#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:20,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {3389#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3390#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:20,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {3390#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3391#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:02:20,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {3391#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3392#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:02:20,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {3392#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:02:20,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:02:20,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {3394#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:02:20,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {3394#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3383#false} is VALID
[2022-04-08 10:02:20,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {3383#false} assume !(~y~0 % 4294967296 > 0); {3383#false} is VALID
[2022-04-08 10:02:20,783 INFO L272 TraceCheckUtils]: 16: Hoare triple {3383#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3383#false} is VALID
[2022-04-08 10:02:20,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID
[2022-04-08 10:02:20,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID
[2022-04-08 10:02:20,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {3383#false} assume !false; {3383#false} is VALID
[2022-04-08 10:02:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:20,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:02:20,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769668763]
[2022-04-08 10:02:20,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769668763] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:02:20,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790079722]
[2022-04-08 10:02:20,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:02:20,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:02:20,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:02:20,784 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:02:20,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2022-04-08 10:02:20,832 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2022-04-08 10:02:20,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:02:20,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core
[2022-04-08 10:02:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:20,842 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:02:21,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3382#true} is VALID
[2022-04-08 10:02:21,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {3382#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3382#true} is VALID
[2022-04-08 10:02:21,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID
[2022-04-08 10:02:21,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #61#return; {3382#true} is VALID
[2022-04-08 10:02:21,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret11 := main(); {3382#true} is VALID
[2022-04-08 10:02:21,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {3382#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3387#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:21,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {3387#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3388#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:21,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {3388#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3389#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:21,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {3389#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3390#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:21,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {3390#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3391#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:02:21,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {3391#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3392#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:02:21,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {3392#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:02:21,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:02:21,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {3438#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:02:21,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {3438#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3383#false} is VALID
[2022-04-08 10:02:21,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {3383#false} assume !(~y~0 % 4294967296 > 0); {3383#false} is VALID
[2022-04-08 10:02:21,041 INFO L272 TraceCheckUtils]: 16: Hoare triple {3383#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3383#false} is VALID
[2022-04-08 10:02:21,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID
[2022-04-08 10:02:21,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID
[2022-04-08 10:02:21,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {3383#false} assume !false; {3383#false} is VALID
[2022-04-08 10:02:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:21,042 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:02:21,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {3383#false} assume !false; {3383#false} is VALID
[2022-04-08 10:02:21,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID
[2022-04-08 10:02:21,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID
[2022-04-08 10:02:21,210 INFO L272 TraceCheckUtils]: 16: Hoare triple {3383#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3383#false} is VALID
[2022-04-08 10:02:21,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {3383#false} assume !(~y~0 % 4294967296 > 0); {3383#false} is VALID
[2022-04-08 10:02:21,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3383#false} is VALID
[2022-04-08 10:02:21,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {3476#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3472#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:02:21,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {3476#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3476#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:02:21,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {3483#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3476#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:02:21,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {3487#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3483#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:02:21,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {3491#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3487#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:02:21,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {3495#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3491#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:02:21,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {3499#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3495#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:02:21,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {3503#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3499#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:02:21,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {3382#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3503#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:02:21,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret11 := main(); {3382#true} is VALID
[2022-04-08 10:02:21,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #61#return; {3382#true} is VALID
[2022-04-08 10:02:21,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID
[2022-04-08 10:02:21,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {3382#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3382#true} is VALID
[2022-04-08 10:02:21,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3382#true} is VALID
[2022-04-08 10:02:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:21,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790079722] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:02:21,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:02:21,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20
[2022-04-08 10:02:21,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:02:21,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820621057]
[2022-04-08 10:02:21,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820621057] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:02:21,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:02:21,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-04-08 10:02:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764966198]
[2022-04-08 10:02:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:02:21,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2022-04-08 10:02:21,217 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:02:21,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:21,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:21,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-04-08 10:02:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:21,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-04-08 10:02:21,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380
[2022-04-08 10:02:21,230 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:21,755 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions.
[2022-04-08 10:02:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-04-08 10:02:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2022-04-08 10:02:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:02:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions.
[2022-04-08 10:02:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions.
[2022-04-08 10:02:21,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 63 transitions.
[2022-04-08 10:02:21,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:21,805 INFO L225 Difference]: With dead ends: 54
[2022-04-08 10:02:21,805 INFO L226 Difference]: Without dead ends: 48
[2022-04-08 10:02:21,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756
[2022-04-08 10:02:21,806 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:02:21,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 63 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:02:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2022-04-08 10:02:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41.
[2022-04-08 10:02:21,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:02:21,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:21,839 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:21,839 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:21,839 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions.
[2022-04-08 10:02:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions.
[2022-04-08 10:02:21,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:21,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:21,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states.
[2022-04-08 10:02:21,840 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states.
[2022-04-08 10:02:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:21,841 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions.
[2022-04-08 10:02:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions.
[2022-04-08 10:02:21,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:21,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:21,841 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:02:21,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:02:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions.
[2022-04-08 10:02:21,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 20
[2022-04-08 10:02:21,842 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:02:21,842 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions.
[2022-04-08 10:02:21,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:21,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 51 transitions.
[2022-04-08 10:02:21,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions.
[2022-04-08 10:02:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-04-08 10:02:21,917 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:02:21,917 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:02:21,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2022-04-08 10:02:22,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2022-04-08 10:02:22,117 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:02:22,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:02:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1249780735, now seen corresponding path program 9 times
[2022-04-08 10:02:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:22,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42555901]
[2022-04-08 10:02:22,121 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:02:22,121 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:02:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1249780735, now seen corresponding path program 10 times
[2022-04-08 10:02:22,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:02:22,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202247957]
[2022-04-08 10:02:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:02:22,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:02:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:22,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:02:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:22,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {3837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3826#true} is VALID
[2022-04-08 10:02:22,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {3826#true} assume true; {3826#true} is VALID
[2022-04-08 10:02:22,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3826#true} {3826#true} #61#return; {3826#true} is VALID
[2022-04-08 10:02:22,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {3826#true} call ULTIMATE.init(); {3837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:02:22,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {3837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3826#true} is VALID
[2022-04-08 10:02:22,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {3826#true} assume true; {3826#true} is VALID
[2022-04-08 10:02:22,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3826#true} {3826#true} #61#return; {3826#true} is VALID
[2022-04-08 10:02:22,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {3826#true} call #t~ret11 := main(); {3826#true} is VALID
[2022-04-08 10:02:22,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {3826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3831#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:22,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {3831#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3832#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:22,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {3832#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:22,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {3833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:22,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:22,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3835#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:02:22,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {3835#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3836#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:02:22,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {3836#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3827#false} is VALID
[2022-04-08 10:02:22,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID
[2022-04-08 10:02:22,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID
[2022-04-08 10:02:22,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID
[2022-04-08 10:02:22,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {3827#false} assume !(~y~0 % 4294967296 > 0); {3827#false} is VALID
[2022-04-08 10:02:22,231 INFO L272 TraceCheckUtils]: 17: Hoare triple {3827#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3827#false} is VALID
[2022-04-08 10:02:22,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {3827#false} ~cond := #in~cond; {3827#false} is VALID
[2022-04-08 10:02:22,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {3827#false} assume 0 == ~cond; {3827#false} is VALID
[2022-04-08 10:02:22,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {3827#false} assume !false; {3827#false} is VALID
[2022-04-08 10:02:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-04-08 10:02:22,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:02:22,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202247957]
[2022-04-08 10:02:22,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202247957] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:02:22,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430970300]
[2022-04-08 10:02:22,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:02:22,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:02:22,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:02:22,233 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:02:22,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2022-04-08 10:02:22,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:02:22,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:02:22,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjunts are in the unsatisfiable core
[2022-04-08 10:02:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:22,277 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:02:22,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {3826#true} call ULTIMATE.init(); {3826#true} is VALID
[2022-04-08 10:02:22,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {3826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3826#true} is VALID
[2022-04-08 10:02:22,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {3826#true} assume true; {3826#true} is VALID
[2022-04-08 10:02:22,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3826#true} {3826#true} #61#return; {3826#true} is VALID
[2022-04-08 10:02:22,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {3826#true} call #t~ret11 := main(); {3826#true} is VALID
[2022-04-08 10:02:22,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {3826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3831#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:22,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {3831#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3832#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:22,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {3832#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:22,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {3833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:22,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:22,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3871#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:22,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {3871#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3875#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:02:22,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {3875#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {3827#false} is VALID
[2022-04-08 10:02:22,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID
[2022-04-08 10:02:22,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID
[2022-04-08 10:02:22,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID
[2022-04-08 10:02:22,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {3827#false} assume !(~y~0 % 4294967296 > 0); {3827#false} is VALID
[2022-04-08 10:02:22,381 INFO L272 TraceCheckUtils]: 17: Hoare triple {3827#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3827#false} is VALID
[2022-04-08 10:02:22,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {3827#false} ~cond := #in~cond; {3827#false} is VALID
[2022-04-08 10:02:22,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {3827#false} assume 0 == ~cond; {3827#false} is VALID
[2022-04-08 10:02:22,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {3827#false} assume !false; {3827#false} is VALID
[2022-04-08 10:02:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-04-08 10:02:22,381 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:02:22,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {3827#false} assume !false; {3827#false} is VALID
[2022-04-08 10:02:22,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {3827#false} assume 0 == ~cond; {3827#false} is VALID
[2022-04-08 10:02:22,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {3827#false} ~cond := #in~cond; {3827#false} is VALID
[2022-04-08 10:02:22,485 INFO L272 TraceCheckUtils]: 17: Hoare triple {3827#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3827#false} is VALID
[2022-04-08 10:02:22,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {3827#false} assume !(~y~0 % 4294967296 > 0); {3827#false} is VALID
[2022-04-08 10:02:22,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID
[2022-04-08 10:02:22,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {3921#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID
[2022-04-08 10:02:22,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {3925#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3921#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:02:22,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {3929#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3925#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:02:22,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {3933#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3929#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID
[2022-04-08 10:02:22,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {3826#true} ~z~0 := ~y~0; {3933#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID
[2022-04-08 10:02:22,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {3826#true} assume !(~x~0 % 4294967296 > 0); {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {3826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {3826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {3826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {3826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {3826#true} call #t~ret11 := main(); {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3826#true} {3826#true} #61#return; {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {3826#true} assume true; {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {3826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {3826#true} call ULTIMATE.init(); {3826#true} is VALID
[2022-04-08 10:02:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2022-04-08 10:02:22,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430970300] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:02:22,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:02:22,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15
[2022-04-08 10:02:22,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:02:22,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42555901]
[2022-04-08 10:02:22,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42555901] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:02:22,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:02:22,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-04-08 10:02:22,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774126861]
[2022-04-08 10:02:22,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:02:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21
[2022-04-08 10:02:22,491 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:02:22,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:22,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:22,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-04-08 10:02:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:22,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-04-08 10:02:22,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210
[2022-04-08 10:02:22,503 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:22,801 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions.
[2022-04-08 10:02:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-04-08 10:02:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21
[2022-04-08 10:02:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:02:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions.
[2022-04-08 10:02:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions.
[2022-04-08 10:02:22,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 39 transitions.
[2022-04-08 10:02:22,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:22,834 INFO L225 Difference]: With dead ends: 56
[2022-04-08 10:02:22,834 INFO L226 Difference]: Without dead ends: 47
[2022-04-08 10:02:22,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420
[2022-04-08 10:02:22,835 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:02:22,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 46 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 10:02:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2022-04-08 10:02:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42.
[2022-04-08 10:02:22,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:02:22,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:22,872 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:22,872 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:22,873 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions.
[2022-04-08 10:02:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions.
[2022-04-08 10:02:22,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:22,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:22,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states.
[2022-04-08 10:02:22,874 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states.
[2022-04-08 10:02:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:22,874 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions.
[2022-04-08 10:02:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions.
[2022-04-08 10:02:22,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:22,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:22,875 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:02:22,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:02:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions.
[2022-04-08 10:02:22,875 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21
[2022-04-08 10:02:22,875 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:02:22,875 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions.
[2022-04-08 10:02:22,875 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:22,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions.
[2022-04-08 10:02:22,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions.
[2022-04-08 10:02:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-04-08 10:02:22,953 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:02:22,953 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:02:22,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2022-04-08 10:02:23,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2022-04-08 10:02:23,153 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:02:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:02:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2056843342, now seen corresponding path program 13 times
[2022-04-08 10:02:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:23,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [653186804]
[2022-04-08 10:02:23,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:02:23,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:02:23,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2056843342, now seen corresponding path program 14 times
[2022-04-08 10:02:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:02:23,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084023548]
[2022-04-08 10:02:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:02:23,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:02:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:23,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:02:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:23,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {4285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4271#true} is VALID
[2022-04-08 10:02:23,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {4271#true} assume true; {4271#true} is VALID
[2022-04-08 10:02:23,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4271#true} {4271#true} #61#return; {4271#true} is VALID
[2022-04-08 10:02:23,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {4271#true} call ULTIMATE.init(); {4285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:02:23,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4271#true} is VALID
[2022-04-08 10:02:23,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {4271#true} assume true; {4271#true} is VALID
[2022-04-08 10:02:23,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4271#true} {4271#true} #61#return; {4271#true} is VALID
[2022-04-08 10:02:23,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {4271#true} call #t~ret11 := main(); {4271#true} is VALID
[2022-04-08 10:02:23,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {4271#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4276#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:23,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {4276#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4277#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:23,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {4277#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4278#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:23,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {4278#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4279#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:23,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {4279#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4280#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:02:23,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {4280#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4281#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:02:23,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {4281#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4282#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:02:23,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {4282#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:02:23,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:02:23,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {4284#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:02:23,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {4284#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4272#false} is VALID
[2022-04-08 10:02:23,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {4272#false} assume !(~y~0 % 4294967296 > 0); {4272#false} is VALID
[2022-04-08 10:02:23,298 INFO L272 TraceCheckUtils]: 17: Hoare triple {4272#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4272#false} is VALID
[2022-04-08 10:02:23,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {4272#false} ~cond := #in~cond; {4272#false} is VALID
[2022-04-08 10:02:23,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {4272#false} assume 0 == ~cond; {4272#false} is VALID
[2022-04-08 10:02:23,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {4272#false} assume !false; {4272#false} is VALID
[2022-04-08 10:02:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:02:23,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084023548]
[2022-04-08 10:02:23,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084023548] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:02:23,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775950816]
[2022-04-08 10:02:23,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:02:23,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:02:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:02:23,300 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:02:23,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2022-04-08 10:02:23,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:02:23,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:02:23,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core
[2022-04-08 10:02:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:23,334 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:02:23,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {4271#true} call ULTIMATE.init(); {4271#true} is VALID
[2022-04-08 10:02:23,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {4271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4271#true} is VALID
[2022-04-08 10:02:23,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {4271#true} assume true; {4271#true} is VALID
[2022-04-08 10:02:23,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4271#true} {4271#true} #61#return; {4271#true} is VALID
[2022-04-08 10:02:23,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {4271#true} call #t~ret11 := main(); {4271#true} is VALID
[2022-04-08 10:02:23,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {4271#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4276#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:23,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {4276#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4277#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:23,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {4277#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4278#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:23,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {4278#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4279#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:23,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {4279#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4280#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:02:23,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {4280#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4281#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:02:23,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {4281#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4282#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:02:23,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {4282#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:02:23,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:02:23,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {4331#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:02:23,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {4331#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4272#false} is VALID
[2022-04-08 10:02:23,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {4272#false} assume !(~y~0 % 4294967296 > 0); {4272#false} is VALID
[2022-04-08 10:02:23,514 INFO L272 TraceCheckUtils]: 17: Hoare triple {4272#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4272#false} is VALID
[2022-04-08 10:02:23,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {4272#false} ~cond := #in~cond; {4272#false} is VALID
[2022-04-08 10:02:23,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {4272#false} assume 0 == ~cond; {4272#false} is VALID
[2022-04-08 10:02:23,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {4272#false} assume !false; {4272#false} is VALID
[2022-04-08 10:02:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:23,514 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:02:23,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {4272#false} assume !false; {4272#false} is VALID
[2022-04-08 10:02:23,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {4272#false} assume 0 == ~cond; {4272#false} is VALID
[2022-04-08 10:02:23,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {4272#false} ~cond := #in~cond; {4272#false} is VALID
[2022-04-08 10:02:23,702 INFO L272 TraceCheckUtils]: 17: Hoare triple {4272#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4272#false} is VALID
[2022-04-08 10:02:23,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {4272#false} assume !(~y~0 % 4294967296 > 0); {4272#false} is VALID
[2022-04-08 10:02:23,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {4365#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4272#false} is VALID
[2022-04-08 10:02:23,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {4369#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {4365#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:02:23,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {4369#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4369#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:02:23,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {4376#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4369#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:02:23,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {4380#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4376#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:02:23,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {4384#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4380#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:02:23,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {4388#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4384#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:02:23,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {4392#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4388#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:02:23,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {4396#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4392#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:02:23,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {4400#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4396#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:02:23,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {4271#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4400#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:02:23,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {4271#true} call #t~ret11 := main(); {4271#true} is VALID
[2022-04-08 10:02:23,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4271#true} {4271#true} #61#return; {4271#true} is VALID
[2022-04-08 10:02:23,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {4271#true} assume true; {4271#true} is VALID
[2022-04-08 10:02:23,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {4271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4271#true} is VALID
[2022-04-08 10:02:23,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {4271#true} call ULTIMATE.init(); {4271#true} is VALID
[2022-04-08 10:02:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:23,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775950816] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:02:23,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:02:23,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22
[2022-04-08 10:02:23,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:02:23,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [653186804]
[2022-04-08 10:02:23,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [653186804] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:02:23,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:02:23,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-04-08 10:02:23,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198852059]
[2022-04-08 10:02:23,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:02:23,709 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21
[2022-04-08 10:02:23,710 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:02:23,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:23,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:23,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-04-08 10:02:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:23,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-04-08 10:02:23,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462
[2022-04-08 10:02:23,724 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:24,395 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions.
[2022-04-08 10:02:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-04-08 10:02:24,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21
[2022-04-08 10:02:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:02:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions.
[2022-04-08 10:02:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions.
[2022-04-08 10:02:24,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions.
[2022-04-08 10:02:24,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:24,460 INFO L225 Difference]: With dead ends: 61
[2022-04-08 10:02:24,460 INFO L226 Difference]: Without dead ends: 55
[2022-04-08 10:02:24,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930
[2022-04-08 10:02:24,462 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:02:24,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 71 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:02:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2022-04-08 10:02:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47.
[2022-04-08 10:02:24,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:02:24,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:24,501 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:24,501 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:24,502 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions.
[2022-04-08 10:02:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions.
[2022-04-08 10:02:24,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:24,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:24,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states.
[2022-04-08 10:02:24,502 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states.
[2022-04-08 10:02:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:24,503 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions.
[2022-04-08 10:02:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions.
[2022-04-08 10:02:24,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:24,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:24,503 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:02:24,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:02:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions.
[2022-04-08 10:02:24,504 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 21
[2022-04-08 10:02:24,504 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:02:24,504 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions.
[2022-04-08 10:02:24,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:24,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 59 transitions.
[2022-04-08 10:02:24,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions.
[2022-04-08 10:02:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-08 10:02:24,565 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:02:24,566 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:02:24,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2022-04-08 10:02:24,782 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2022-04-08 10:02:24,782 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:02:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:02:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 11 times
[2022-04-08 10:02:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:24,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1796367301]
[2022-04-08 10:02:24,785 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:02:24,785 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:02:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 12 times
[2022-04-08 10:02:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:02:24,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546465421]
[2022-04-08 10:02:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:02:24,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:02:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:24,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:02:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:24,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {4777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4765#true} is VALID
[2022-04-08 10:02:24,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {4765#true} assume true; {4765#true} is VALID
[2022-04-08 10:02:24,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4765#true} {4765#true} #61#return; {4765#true} is VALID
[2022-04-08 10:02:24,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {4765#true} call ULTIMATE.init(); {4777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:02:24,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {4777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4765#true} is VALID
[2022-04-08 10:02:24,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {4765#true} assume true; {4765#true} is VALID
[2022-04-08 10:02:24,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4765#true} {4765#true} #61#return; {4765#true} is VALID
[2022-04-08 10:02:24,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {4765#true} call #t~ret11 := main(); {4765#true} is VALID
[2022-04-08 10:02:24,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {4765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4770#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:24,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {4770#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4771#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:24,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {4771#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4772#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:24,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {4772#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:24,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:24,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4774#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:02:24,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {4774#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4775#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:02:24,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {4775#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4776#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:02:24,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {4776#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4766#false} is VALID
[2022-04-08 10:02:24,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID
[2022-04-08 10:02:24,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID
[2022-04-08 10:02:24,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID
[2022-04-08 10:02:24,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {4766#false} assume !(~y~0 % 4294967296 > 0); {4766#false} is VALID
[2022-04-08 10:02:24,889 INFO L272 TraceCheckUtils]: 18: Hoare triple {4766#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4766#false} is VALID
[2022-04-08 10:02:24,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {4766#false} ~cond := #in~cond; {4766#false} is VALID
[2022-04-08 10:02:24,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {4766#false} assume 0 == ~cond; {4766#false} is VALID
[2022-04-08 10:02:24,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {4766#false} assume !false; {4766#false} is VALID
[2022-04-08 10:02:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-04-08 10:02:24,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:02:24,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546465421]
[2022-04-08 10:02:24,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546465421] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:02:24,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489593819]
[2022-04-08 10:02:24,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:02:24,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:02:24,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:02:24,891 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:02:24,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2022-04-08 10:02:24,922 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s)
[2022-04-08 10:02:24,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:02:24,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core
[2022-04-08 10:02:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:24,928 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:02:25,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {4765#true} call ULTIMATE.init(); {4765#true} is VALID
[2022-04-08 10:02:25,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {4765#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4765#true} is VALID
[2022-04-08 10:02:25,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {4765#true} assume true; {4765#true} is VALID
[2022-04-08 10:02:25,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4765#true} {4765#true} #61#return; {4765#true} is VALID
[2022-04-08 10:02:25,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {4765#true} call #t~ret11 := main(); {4765#true} is VALID
[2022-04-08 10:02:25,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {4765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4770#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:25,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {4770#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4771#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:25,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {4771#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4772#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:25,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {4772#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:25,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:25,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4811#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:25,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {4811#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4815#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:02:25,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {4815#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4819#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:25,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {4819#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4766#false} is VALID
[2022-04-08 10:02:25,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID
[2022-04-08 10:02:25,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID
[2022-04-08 10:02:25,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID
[2022-04-08 10:02:25,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {4766#false} assume !(~y~0 % 4294967296 > 0); {4766#false} is VALID
[2022-04-08 10:02:25,058 INFO L272 TraceCheckUtils]: 18: Hoare triple {4766#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4766#false} is VALID
[2022-04-08 10:02:25,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {4766#false} ~cond := #in~cond; {4766#false} is VALID
[2022-04-08 10:02:25,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {4766#false} assume 0 == ~cond; {4766#false} is VALID
[2022-04-08 10:02:25,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {4766#false} assume !false; {4766#false} is VALID
[2022-04-08 10:02:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-04-08 10:02:25,058 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:02:25,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {4766#false} assume !false; {4766#false} is VALID
[2022-04-08 10:02:25,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {4766#false} assume 0 == ~cond; {4766#false} is VALID
[2022-04-08 10:02:25,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {4766#false} ~cond := #in~cond; {4766#false} is VALID
[2022-04-08 10:02:25,210 INFO L272 TraceCheckUtils]: 18: Hoare triple {4766#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4766#false} is VALID
[2022-04-08 10:02:25,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {4766#false} assume !(~y~0 % 4294967296 > 0); {4766#false} is VALID
[2022-04-08 10:02:25,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {4862#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID
[2022-04-08 10:02:25,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {4866#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4862#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:02:25,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {4870#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4866#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:02:25,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {4874#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4870#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:02:25,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {4878#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4874#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID
[2022-04-08 10:02:25,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {4882#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4878#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:02:25,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {4765#true} ~z~0 := ~y~0; {4882#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID
[2022-04-08 10:02:25,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {4765#true} assume !(~x~0 % 4294967296 > 0); {4765#true} is VALID
[2022-04-08 10:02:25,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {4765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4765#true} is VALID
[2022-04-08 10:02:25,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {4765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4765#true} is VALID
[2022-04-08 10:02:25,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {4765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4765#true} is VALID
[2022-04-08 10:02:25,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {4765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4765#true} is VALID
[2022-04-08 10:02:25,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {4765#true} call #t~ret11 := main(); {4765#true} is VALID
[2022-04-08 10:02:25,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4765#true} {4765#true} #61#return; {4765#true} is VALID
[2022-04-08 10:02:25,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {4765#true} assume true; {4765#true} is VALID
[2022-04-08 10:02:25,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {4765#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4765#true} is VALID
[2022-04-08 10:02:25,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {4765#true} call ULTIMATE.init(); {4765#true} is VALID
[2022-04-08 10:02:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-04-08 10:02:25,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489593819] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:02:25,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:02:25,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19
[2022-04-08 10:02:25,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:02:25,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1796367301]
[2022-04-08 10:02:25,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1796367301] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:02:25,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:02:25,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-08 10:02:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463523131]
[2022-04-08 10:02:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:02:25,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22
[2022-04-08 10:02:25,216 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:02:25,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:25,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:25,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-08 10:02:25,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-08 10:02:25,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342
[2022-04-08 10:02:25,244 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:25,610 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions.
[2022-04-08 10:02:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-08 10:02:25,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22
[2022-04-08 10:02:25,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:02:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions.
[2022-04-08 10:02:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions.
[2022-04-08 10:02:25,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions.
[2022-04-08 10:02:25,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:25,662 INFO L225 Difference]: With dead ends: 62
[2022-04-08 10:02:25,662 INFO L226 Difference]: Without dead ends: 53
[2022-04-08 10:02:25,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650
[2022-04-08 10:02:25,663 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:02:25,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 10:02:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2022-04-08 10:02:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48.
[2022-04-08 10:02:25,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:02:25,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:25,699 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:25,699 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:25,700 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions.
[2022-04-08 10:02:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions.
[2022-04-08 10:02:25,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:25,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:25,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states.
[2022-04-08 10:02:25,701 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states.
[2022-04-08 10:02:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:25,701 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions.
[2022-04-08 10:02:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions.
[2022-04-08 10:02:25,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:25,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:25,702 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:02:25,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:02:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions.
[2022-04-08 10:02:25,702 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 22
[2022-04-08 10:02:25,702 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:02:25,702 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions.
[2022-04-08 10:02:25,703 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:25,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 60 transitions.
[2022-04-08 10:02:25,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions.
[2022-04-08 10:02:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-08 10:02:25,775 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:02:25,775 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:02:25,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2022-04-08 10:02:25,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2022-04-08 10:02:25,975 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:02:25,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:02:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash 190490061, now seen corresponding path program 15 times
[2022-04-08 10:02:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:25,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755947096]
[2022-04-08 10:02:25,978 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:02:25,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:02:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 190490061, now seen corresponding path program 16 times
[2022-04-08 10:02:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:02:25,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448751015]
[2022-04-08 10:02:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:02:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:02:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:26,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:02:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:26,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {5273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID
[2022-04-08 10:02:26,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#true} assume true; {5258#true} is VALID
[2022-04-08 10:02:26,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID
[2022-04-08 10:02:26,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:02:26,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {5273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID
[2022-04-08 10:02:26,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID
[2022-04-08 10:02:26,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID
[2022-04-08 10:02:26,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret11 := main(); {5258#true} is VALID
[2022-04-08 10:02:26,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5263#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:26,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {5263#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5264#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:26,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {5264#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5265#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:26,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {5265#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5266#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:26,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {5266#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5267#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:02:26,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {5267#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5268#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:02:26,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {5268#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5269#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:02:26,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {5269#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5270#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:02:26,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {5270#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:02:26,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:02:26,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {5272#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:02:26,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {5272#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {5259#false} is VALID
[2022-04-08 10:02:26,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {5259#false} assume !(~y~0 % 4294967296 > 0); {5259#false} is VALID
[2022-04-08 10:02:26,143 INFO L272 TraceCheckUtils]: 18: Hoare triple {5259#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5259#false} is VALID
[2022-04-08 10:02:26,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {5259#false} ~cond := #in~cond; {5259#false} is VALID
[2022-04-08 10:02:26,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {5259#false} assume 0 == ~cond; {5259#false} is VALID
[2022-04-08 10:02:26,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {5259#false} assume !false; {5259#false} is VALID
[2022-04-08 10:02:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:02:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448751015]
[2022-04-08 10:02:26,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448751015] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:02:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677347155]
[2022-04-08 10:02:26,144 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:02:26,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:02:26,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:02:26,145 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:02:26,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2022-04-08 10:02:26,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:02:26,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:02:26,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core
[2022-04-08 10:02:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:26,181 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:02:26,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5258#true} is VALID
[2022-04-08 10:02:26,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID
[2022-04-08 10:02:26,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID
[2022-04-08 10:02:26,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID
[2022-04-08 10:02:26,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret11 := main(); {5258#true} is VALID
[2022-04-08 10:02:26,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5263#(= main_~y~0 0)} is VALID
[2022-04-08 10:02:26,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {5263#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5264#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:26,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {5264#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5265#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:02:26,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {5265#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5266#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:02:26,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {5266#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5267#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:02:26,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {5267#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5268#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:02:26,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {5268#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5269#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:02:26,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {5269#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5270#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:02:26,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {5270#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:02:26,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:02:26,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {5322#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:02:26,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {5322#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {5259#false} is VALID
[2022-04-08 10:02:26,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {5259#false} assume !(~y~0 % 4294967296 > 0); {5259#false} is VALID
[2022-04-08 10:02:26,391 INFO L272 TraceCheckUtils]: 18: Hoare triple {5259#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5259#false} is VALID
[2022-04-08 10:02:26,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {5259#false} ~cond := #in~cond; {5259#false} is VALID
[2022-04-08 10:02:26,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {5259#false} assume 0 == ~cond; {5259#false} is VALID
[2022-04-08 10:02:26,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {5259#false} assume !false; {5259#false} is VALID
[2022-04-08 10:02:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:26,391 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:02:26,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {5259#false} assume !false; {5259#false} is VALID
[2022-04-08 10:02:26,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {5259#false} assume 0 == ~cond; {5259#false} is VALID
[2022-04-08 10:02:26,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {5259#false} ~cond := #in~cond; {5259#false} is VALID
[2022-04-08 10:02:26,616 INFO L272 TraceCheckUtils]: 18: Hoare triple {5259#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5259#false} is VALID
[2022-04-08 10:02:26,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {5259#false} assume !(~y~0 % 4294967296 > 0); {5259#false} is VALID
[2022-04-08 10:02:26,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {5356#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5259#false} is VALID
[2022-04-08 10:02:26,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {5360#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {5356#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:02:26,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {5360#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5360#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:02:26,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {5367#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5360#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:02:26,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {5371#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:02:26,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {5375#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5371#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:02:26,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {5379#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5375#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:02:26,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {5383#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5379#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:02:26,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {5387#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5383#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:02:26,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {5391#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5387#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:02:26,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {5395#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5391#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:02:26,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5395#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:02:26,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret11 := main(); {5258#true} is VALID
[2022-04-08 10:02:26,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID
[2022-04-08 10:02:26,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID
[2022-04-08 10:02:26,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID
[2022-04-08 10:02:26,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5258#true} is VALID
[2022-04-08 10:02:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:26,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677347155] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:02:26,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:02:26,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24
[2022-04-08 10:02:26,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:02:26,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755947096]
[2022-04-08 10:02:26,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755947096] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:02:26,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:02:26,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-04-08 10:02:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711151055]
[2022-04-08 10:02:26,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:02:26,631 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22
[2022-04-08 10:02:26,631 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:02:26,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:26,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:26,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-04-08 10:02:26,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:26,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-04-08 10:02:26,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552
[2022-04-08 10:02:26,646 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:27,459 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions.
[2022-04-08 10:02:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-04-08 10:02:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22
[2022-04-08 10:02:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:02:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions.
[2022-04-08 10:02:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions.
[2022-04-08 10:02:27,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 77 transitions.
[2022-04-08 10:02:27,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:27,522 INFO L225 Difference]: With dead ends: 68
[2022-04-08 10:02:27,522 INFO L226 Difference]: Without dead ends: 62
[2022-04-08 10:02:27,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122
[2022-04-08 10:02:27,523 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:02:27,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 79 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:02:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2022-04-08 10:02:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53.
[2022-04-08 10:02:27,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:02:27,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:27,588 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:27,588 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:27,589 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions.
[2022-04-08 10:02:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions.
[2022-04-08 10:02:27,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:27,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:27,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states.
[2022-04-08 10:02:27,589 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states.
[2022-04-08 10:02:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:27,590 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions.
[2022-04-08 10:02:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions.
[2022-04-08 10:02:27,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:27,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:27,590 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:02:27,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:02:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions.
[2022-04-08 10:02:27,591 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 22
[2022-04-08 10:02:27,591 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:02:27,591 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions.
[2022-04-08 10:02:27,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:27,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions.
[2022-04-08 10:02:27,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions.
[2022-04-08 10:02:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-08 10:02:27,675 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:02:27,675 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:02:27,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2022-04-08 10:02:27,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:02:27,886 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:02:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:02:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 13 times
[2022-04-08 10:02:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:27,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [515163160]
[2022-04-08 10:02:27,889 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:02:27,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:02:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 14 times
[2022-04-08 10:02:27,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:02:27,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241521408]
[2022-04-08 10:02:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:02:27,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:02:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:02:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:28,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {5819#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5802#true} is VALID
[2022-04-08 10:02:28,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {5802#true} assume true; {5802#true} is VALID
[2022-04-08 10:02:28,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5802#true} {5802#true} #61#return; {5802#true} is VALID
[2022-04-08 10:02:28,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {5802#true} call ULTIMATE.init(); {5819#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:02:28,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {5819#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5802#true} is VALID
[2022-04-08 10:02:28,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {5802#true} assume true; {5802#true} is VALID
[2022-04-08 10:02:28,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5802#true} {5802#true} #61#return; {5802#true} is VALID
[2022-04-08 10:02:28,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {5802#true} call #t~ret11 := main(); {5802#true} is VALID
[2022-04-08 10:02:28,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {5802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5807#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:02:28,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {5807#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5808#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:02:28,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {5808#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5809#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:02:28,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {5809#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5810#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 3) main_~n~0))} is VALID
[2022-04-08 10:02:28,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {5810#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 3) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {5811#(and (<= main_~y~0 3) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 3) main_~n~0))} is VALID
[2022-04-08 10:02:28,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {5811#(and (<= main_~y~0 3) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 3) main_~n~0))} ~z~0 := ~y~0; {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} is VALID
[2022-04-08 10:02:28,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:02:28,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} is VALID
[2022-04-08 10:02:28,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:02:28,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:02:28,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} is VALID
[2022-04-08 10:02:28,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:02:28,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:28,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:28,301 INFO L272 TraceCheckUtils]: 19: Hoare triple {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:02:28,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5818#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:02:28,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {5818#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5803#false} is VALID
[2022-04-08 10:02:28,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {5803#false} assume !false; {5803#false} is VALID
[2022-04-08 10:02:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:28,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:02:28,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241521408]
[2022-04-08 10:02:28,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241521408] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:02:28,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976824336]
[2022-04-08 10:02:28,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:02:28,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:02:28,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:02:28,303 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:02:28,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2022-04-08 10:02:28,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:02:28,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:02:28,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 41 conjunts are in the unsatisfiable core
[2022-04-08 10:02:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:02:28,368 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:02:57,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {5802#true} call ULTIMATE.init(); {5802#true} is VALID
[2022-04-08 10:02:57,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {5802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5802#true} is VALID
[2022-04-08 10:02:57,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {5802#true} assume true; {5802#true} is VALID
[2022-04-08 10:02:57,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5802#true} {5802#true} #61#return; {5802#true} is VALID
[2022-04-08 10:02:57,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {5802#true} call #t~ret11 := main(); {5802#true} is VALID
[2022-04-08 10:02:57,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {5802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5807#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:02:57,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {5807#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5841#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID
[2022-04-08 10:02:57,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {5841#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5845#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID
[2022-04-08 10:02:57,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {5845#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5849#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} is VALID
[2022-04-08 10:02:57,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {5849#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} assume !(~x~0 % 4294967296 > 0); {5853#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3) (not (< 0 (mod main_~x~0 4294967296))))} is VALID
[2022-04-08 10:02:57,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {5853#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {5857#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (not (< 0 (mod main_~x~0 4294967296))) (= main_~z~0 3))} is VALID
[2022-04-08 10:02:57,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {5857#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (not (< 0 (mod main_~x~0 4294967296))) (= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5861#(and (= 3 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ (- 2) main_~n~0) main_~x~0))} is VALID
[2022-04-08 10:02:57,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {5861#(and (= 3 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ (- 2) main_~n~0) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5865#(and (= main_~x~0 (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} is VALID
[2022-04-08 10:02:57,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {5865#(and (= main_~x~0 (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:02:57,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:02:57,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} is VALID
[2022-04-08 10:02:57,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:02:57,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} is VALID
[2022-04-08 10:02:57,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} is VALID
[2022-04-08 10:02:57,325 INFO L272 TraceCheckUtils]: 19: Hoare triple {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5887#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:02:57,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {5887#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5891#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:02:57,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {5891#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5803#false} is VALID
[2022-04-08 10:02:57,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {5803#false} assume !false; {5803#false} is VALID
[2022-04-08 10:02:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:57,326 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:02:58,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {5803#false} assume !false; {5803#false} is VALID
[2022-04-08 10:02:58,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {5891#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5803#false} is VALID
[2022-04-08 10:02:58,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {5887#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5891#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:02:58,294 INFO L272 TraceCheckUtils]: 19: Hoare triple {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5887#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:02:58,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:58,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {5913#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:58,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {5917#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5913#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:58,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {5921#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5917#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:02:58,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {5921#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5921#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:58,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {5917#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5921#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:58,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {5913#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5917#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:02:58,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {5934#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5913#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:02:58,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {5938#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {5934#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:02:58,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {5942#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {5938#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:02:58,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {5946#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5942#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:02:58,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {5950#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5946#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:02:58,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {5954#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (<= (mod (+ main_~y~0 3) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5950#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:02:58,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {5802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5954#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (<= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID
[2022-04-08 10:02:58,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {5802#true} call #t~ret11 := main(); {5802#true} is VALID
[2022-04-08 10:02:58,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5802#true} {5802#true} #61#return; {5802#true} is VALID
[2022-04-08 10:02:58,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {5802#true} assume true; {5802#true} is VALID
[2022-04-08 10:02:58,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {5802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5802#true} is VALID
[2022-04-08 10:02:58,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {5802#true} call ULTIMATE.init(); {5802#true} is VALID
[2022-04-08 10:02:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:02:58,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976824336] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:02:58,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:02:58,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 33
[2022-04-08 10:02:58,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:02:58,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [515163160]
[2022-04-08 10:02:58,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [515163160] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:02:58,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:02:58,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-04-08 10:02:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644652850]
[2022-04-08 10:02:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:02:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 10:02:58,315 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:02:58,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:58,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:58,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-04-08 10:02:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:02:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-04-08 10:02:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056
[2022-04-08 10:02:58,348 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:59,434 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions.
[2022-04-08 10:02:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-04-08 10:02:59,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 10:02:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:02:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 43 transitions.
[2022-04-08 10:02:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 43 transitions.
[2022-04-08 10:02:59,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 43 transitions.
[2022-04-08 10:02:59,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:02:59,495 INFO L225 Difference]: With dead ends: 70
[2022-04-08 10:02:59,495 INFO L226 Difference]: Without dead ends: 48
[2022-04-08 10:02:59,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1919, Unknown=0, NotChecked=0, Total=2162
[2022-04-08 10:02:59,496 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:02:59,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 69 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:02:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2022-04-08 10:02:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2022-04-08 10:02:59,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:02:59,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:59,536 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:59,536 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:59,537 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions.
[2022-04-08 10:02:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions.
[2022-04-08 10:02:59,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:59,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:59,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states.
[2022-04-08 10:02:59,537 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states.
[2022-04-08 10:02:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:02:59,538 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions.
[2022-04-08 10:02:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions.
[2022-04-08 10:02:59,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:02:59,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:02:59,538 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:02:59,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:02:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions.
[2022-04-08 10:02:59,539 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23
[2022-04-08 10:02:59,539 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:02:59,539 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions.
[2022-04-08 10:02:59,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:02:59,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 60 transitions.
[2022-04-08 10:03:00,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions.
[2022-04-08 10:03:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-08 10:03:00,560 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:00,560 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:00,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2022-04-08 10:03:00,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2022-04-08 10:03:00,763 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:00,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1899384657, now seen corresponding path program 15 times
[2022-04-08 10:03:00,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:00,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1062253093]
[2022-04-08 10:03:00,767 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:00,767 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:00,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1899384657, now seen corresponding path program 16 times
[2022-04-08 10:03:00,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:00,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535201248]
[2022-04-08 10:03:00,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:00,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:00,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {6347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6335#true} is VALID
[2022-04-08 10:03:00,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {6335#true} assume true; {6335#true} is VALID
[2022-04-08 10:03:00,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6335#true} {6335#true} #61#return; {6335#true} is VALID
[2022-04-08 10:03:00,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {6335#true} call ULTIMATE.init(); {6347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:00,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {6347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6335#true} is VALID
[2022-04-08 10:03:00,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {6335#true} assume true; {6335#true} is VALID
[2022-04-08 10:03:00,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6335#true} {6335#true} #61#return; {6335#true} is VALID
[2022-04-08 10:03:00,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {6335#true} call #t~ret11 := main(); {6335#true} is VALID
[2022-04-08 10:03:00,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {6335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6340#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:00,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {6340#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6341#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:00,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {6341#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6342#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:00,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {6342#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6343#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:00,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {6343#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:00,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:00,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6345#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:00,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {6345#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6346#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:03:00,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {6346#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6336#false} is VALID
[2022-04-08 10:03:00,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:00,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:00,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:00,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:00,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {6336#false} assume !(~y~0 % 4294967296 > 0); {6336#false} is VALID
[2022-04-08 10:03:00,884 INFO L272 TraceCheckUtils]: 19: Hoare triple {6336#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6336#false} is VALID
[2022-04-08 10:03:00,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {6336#false} ~cond := #in~cond; {6336#false} is VALID
[2022-04-08 10:03:00,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {6336#false} assume 0 == ~cond; {6336#false} is VALID
[2022-04-08 10:03:00,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {6336#false} assume !false; {6336#false} is VALID
[2022-04-08 10:03:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2022-04-08 10:03:00,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:00,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535201248]
[2022-04-08 10:03:00,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535201248] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:00,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176092575]
[2022-04-08 10:03:00,885 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:03:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:00,886 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:00,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2022-04-08 10:03:00,919 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:03:00,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:00,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjunts are in the unsatisfiable core
[2022-04-08 10:03:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:00,925 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:01,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {6335#true} call ULTIMATE.init(); {6335#true} is VALID
[2022-04-08 10:03:01,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {6335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6335#true} is VALID
[2022-04-08 10:03:01,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {6335#true} assume true; {6335#true} is VALID
[2022-04-08 10:03:01,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6335#true} {6335#true} #61#return; {6335#true} is VALID
[2022-04-08 10:03:01,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {6335#true} call #t~ret11 := main(); {6335#true} is VALID
[2022-04-08 10:03:01,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {6335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6340#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:01,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {6340#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6341#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:01,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {6341#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6342#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:01,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {6342#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6343#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:01,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {6343#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:01,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:01,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6384#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:01,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {6384#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6388#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:03:01,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {6388#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {6336#false} is VALID
[2022-04-08 10:03:01,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:01,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:01,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:01,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:01,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {6336#false} assume !(~y~0 % 4294967296 > 0); {6336#false} is VALID
[2022-04-08 10:03:01,047 INFO L272 TraceCheckUtils]: 19: Hoare triple {6336#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6336#false} is VALID
[2022-04-08 10:03:01,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {6336#false} ~cond := #in~cond; {6336#false} is VALID
[2022-04-08 10:03:01,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {6336#false} assume 0 == ~cond; {6336#false} is VALID
[2022-04-08 10:03:01,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {6336#false} assume !false; {6336#false} is VALID
[2022-04-08 10:03:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2022-04-08 10:03:01,048 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:01,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {6336#false} assume !false; {6336#false} is VALID
[2022-04-08 10:03:01,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {6336#false} assume 0 == ~cond; {6336#false} is VALID
[2022-04-08 10:03:01,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {6336#false} ~cond := #in~cond; {6336#false} is VALID
[2022-04-08 10:03:01,160 INFO L272 TraceCheckUtils]: 19: Hoare triple {6336#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6336#false} is VALID
[2022-04-08 10:03:01,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {6336#false} assume !(~y~0 % 4294967296 > 0); {6336#false} is VALID
[2022-04-08 10:03:01,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:01,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:01,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {6440#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID
[2022-04-08 10:03:01,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {6444#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6440#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:03:01,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {6448#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6444#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:01,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {6452#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6448#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID
[2022-04-08 10:03:01,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {6335#true} ~z~0 := ~y~0; {6452#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID
[2022-04-08 10:03:01,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {6335#true} assume !(~x~0 % 4294967296 > 0); {6335#true} is VALID
[2022-04-08 10:03:01,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {6335#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {6335#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {6335#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {6335#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {6335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {6335#true} call #t~ret11 := main(); {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6335#true} {6335#true} #61#return; {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {6335#true} assume true; {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {6335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {6335#true} call ULTIMATE.init(); {6335#true} is VALID
[2022-04-08 10:03:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2022-04-08 10:03:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176092575] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:01,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:01,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16
[2022-04-08 10:03:01,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:01,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1062253093]
[2022-04-08 10:03:01,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1062253093] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:01,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:01,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-08 10:03:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335452178]
[2022-04-08 10:03:01,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 10:03:01,168 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:01,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:01,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:01,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-08 10:03:01,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:01,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-08 10:03:01,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240
[2022-04-08 10:03:01,181 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:01,513 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions.
[2022-04-08 10:03:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-08 10:03:01,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 10:03:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions.
[2022-04-08 10:03:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions.
[2022-04-08 10:03:01,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 41 transitions.
[2022-04-08 10:03:01,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:01,549 INFO L225 Difference]: With dead ends: 65
[2022-04-08 10:03:01,549 INFO L226 Difference]: Without dead ends: 55
[2022-04-08 10:03:01,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506
[2022-04-08 10:03:01,549 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:01,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 46 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 10:03:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2022-04-08 10:03:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49.
[2022-04-08 10:03:01,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:01,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:01,588 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:01,588 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:01,589 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions.
[2022-04-08 10:03:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions.
[2022-04-08 10:03:01,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:01,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:01,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states.
[2022-04-08 10:03:01,589 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states.
[2022-04-08 10:03:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:01,590 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions.
[2022-04-08 10:03:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions.
[2022-04-08 10:03:01,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:01,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:01,590 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:01,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:01,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions.
[2022-04-08 10:03:01,591 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 23
[2022-04-08 10:03:01,591 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:01,591 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions.
[2022-04-08 10:03:01,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:01,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 61 transitions.
[2022-04-08 10:03:01,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions.
[2022-04-08 10:03:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-08 10:03:01,715 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:01,715 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:01,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0
[2022-04-08 10:03:01,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2022-04-08 10:03:01,915 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1831886802, now seen corresponding path program 17 times
[2022-04-08 10:03:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:01,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437965571]
[2022-04-08 10:03:01,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:01,918 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1831886802, now seen corresponding path program 18 times
[2022-04-08 10:03:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:01,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277827597]
[2022-04-08 10:03:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:02,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:02,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {6859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6843#true} is VALID
[2022-04-08 10:03:02,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {6843#true} assume true; {6843#true} is VALID
[2022-04-08 10:03:02,105 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6843#true} {6843#true} #61#return; {6843#true} is VALID
[2022-04-08 10:03:02,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {6843#true} call ULTIMATE.init(); {6859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:02,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6843#true} is VALID
[2022-04-08 10:03:02,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {6843#true} assume true; {6843#true} is VALID
[2022-04-08 10:03:02,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6843#true} {6843#true} #61#return; {6843#true} is VALID
[2022-04-08 10:03:02,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {6843#true} call #t~ret11 := main(); {6843#true} is VALID
[2022-04-08 10:03:02,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {6843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6848#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:02,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {6848#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:02,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {6849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:02,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {6850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6851#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:02,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {6851#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6852#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:02,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {6852#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6853#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:02,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {6853#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6854#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:02,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {6854#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6855#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:02,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {6855#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6856#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:02,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {6856#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:02,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:02,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {6858#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:03:02,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {6858#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6844#false} is VALID
[2022-04-08 10:03:02,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {6844#false} assume !(~y~0 % 4294967296 > 0); {6844#false} is VALID
[2022-04-08 10:03:02,113 INFO L272 TraceCheckUtils]: 19: Hoare triple {6844#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6844#false} is VALID
[2022-04-08 10:03:02,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {6844#false} ~cond := #in~cond; {6844#false} is VALID
[2022-04-08 10:03:02,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {6844#false} assume 0 == ~cond; {6844#false} is VALID
[2022-04-08 10:03:02,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {6844#false} assume !false; {6844#false} is VALID
[2022-04-08 10:03:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:02,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:02,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277827597]
[2022-04-08 10:03:02,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277827597] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:02,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508563194]
[2022-04-08 10:03:02,114 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:03:02,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:02,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:02,116 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:02,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2022-04-08 10:03:02,156 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s)
[2022-04-08 10:03:02,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:02,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core
[2022-04-08 10:03:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:02,163 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:02,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {6843#true} call ULTIMATE.init(); {6843#true} is VALID
[2022-04-08 10:03:02,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {6843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6843#true} is VALID
[2022-04-08 10:03:02,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {6843#true} assume true; {6843#true} is VALID
[2022-04-08 10:03:02,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6843#true} {6843#true} #61#return; {6843#true} is VALID
[2022-04-08 10:03:02,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {6843#true} call #t~ret11 := main(); {6843#true} is VALID
[2022-04-08 10:03:02,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {6843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6848#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:02,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {6848#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:02,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {6849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:02,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {6850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6851#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:02,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {6851#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6852#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:02,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {6852#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6853#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:02,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {6853#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6854#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:02,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {6854#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6855#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:02,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {6855#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6856#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:02,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {6856#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:02,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:02,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {6911#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:03:02,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {6911#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {6844#false} is VALID
[2022-04-08 10:03:02,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {6844#false} assume !(~y~0 % 4294967296 > 0); {6844#false} is VALID
[2022-04-08 10:03:02,375 INFO L272 TraceCheckUtils]: 19: Hoare triple {6844#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6844#false} is VALID
[2022-04-08 10:03:02,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {6844#false} ~cond := #in~cond; {6844#false} is VALID
[2022-04-08 10:03:02,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {6844#false} assume 0 == ~cond; {6844#false} is VALID
[2022-04-08 10:03:02,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {6844#false} assume !false; {6844#false} is VALID
[2022-04-08 10:03:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:02,375 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:02,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {6844#false} assume !false; {6844#false} is VALID
[2022-04-08 10:03:02,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {6844#false} assume 0 == ~cond; {6844#false} is VALID
[2022-04-08 10:03:02,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {6844#false} ~cond := #in~cond; {6844#false} is VALID
[2022-04-08 10:03:02,632 INFO L272 TraceCheckUtils]: 19: Hoare triple {6844#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6844#false} is VALID
[2022-04-08 10:03:02,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {6844#false} assume !(~y~0 % 4294967296 > 0); {6844#false} is VALID
[2022-04-08 10:03:02,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {6945#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6844#false} is VALID
[2022-04-08 10:03:02,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {6949#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {6945#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:03:02,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {6949#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6949#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:02,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {6956#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6949#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:02,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {6960#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6956#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:03:02,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {6964#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6960#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:03:02,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {6968#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6964#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:03:02,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {6972#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6968#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:03:02,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {6976#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6972#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:02,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {6980#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6976#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:03:02,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {6984#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6980#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:02,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {6988#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6984#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:03:02,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {6843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6988#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:03:02,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {6843#true} call #t~ret11 := main(); {6843#true} is VALID
[2022-04-08 10:03:02,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6843#true} {6843#true} #61#return; {6843#true} is VALID
[2022-04-08 10:03:02,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {6843#true} assume true; {6843#true} is VALID
[2022-04-08 10:03:02,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {6843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6843#true} is VALID
[2022-04-08 10:03:02,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {6843#true} call ULTIMATE.init(); {6843#true} is VALID
[2022-04-08 10:03:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:02,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508563194] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:02,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:02,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26
[2022-04-08 10:03:02,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:02,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437965571]
[2022-04-08 10:03:02,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437965571] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:02,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:02,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-04-08 10:03:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037529914]
[2022-04-08 10:03:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:02,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 10:03:02,642 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:02,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:02,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:02,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-04-08 10:03:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:02,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-04-08 10:03:02,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650
[2022-04-08 10:03:02,658 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:03,692 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions.
[2022-04-08 10:03:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-04-08 10:03:03,692 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23
[2022-04-08 10:03:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:03,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions.
[2022-04-08 10:03:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions.
[2022-04-08 10:03:03,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 80 transitions.
[2022-04-08 10:03:03,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:03,765 INFO L225 Difference]: With dead ends: 70
[2022-04-08 10:03:03,765 INFO L226 Difference]: Without dead ends: 64
[2022-04-08 10:03:03,766 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332
[2022-04-08 10:03:03,766 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:03,766 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 84 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:03:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2022-04-08 10:03:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54.
[2022-04-08 10:03:03,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:03,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:03,820 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:03,820 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:03,821 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions.
[2022-04-08 10:03:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions.
[2022-04-08 10:03:03,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:03,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:03,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states.
[2022-04-08 10:03:03,821 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states.
[2022-04-08 10:03:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:03,822 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions.
[2022-04-08 10:03:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions.
[2022-04-08 10:03:03,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:03,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:03,822 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:03,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions.
[2022-04-08 10:03:03,823 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 23
[2022-04-08 10:03:03,823 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:03,823 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions.
[2022-04-08 10:03:03,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:03,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions.
[2022-04-08 10:03:04,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions.
[2022-04-08 10:03:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-08 10:03:04,530 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:04,530 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:04,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0
[2022-04-08 10:03:04,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2022-04-08 10:03:04,738 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:04,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:04,738 INFO L85 PathProgramCache]: Analyzing trace with hash 243885709, now seen corresponding path program 17 times
[2022-04-08 10:03:04,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:04,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [636458825]
[2022-04-08 10:03:04,741 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:04,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:04,741 INFO L85 PathProgramCache]: Analyzing trace with hash 243885709, now seen corresponding path program 18 times
[2022-04-08 10:03:04,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:04,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835304767]
[2022-04-08 10:03:04,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:04,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7407#true} is VALID
[2022-04-08 10:03:04,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {7407#true} assume true; {7407#true} is VALID
[2022-04-08 10:03:04,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7407#true} {7407#true} #61#return; {7407#true} is VALID
[2022-04-08 10:03:04,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {7407#true} call ULTIMATE.init(); {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:04,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7407#true} is VALID
[2022-04-08 10:03:04,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {7407#true} assume true; {7407#true} is VALID
[2022-04-08 10:03:04,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7407#true} {7407#true} #61#return; {7407#true} is VALID
[2022-04-08 10:03:04,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {7407#true} call #t~ret11 := main(); {7407#true} is VALID
[2022-04-08 10:03:04,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {7407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7412#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:04,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {7412#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:04,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:04,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {7414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:04,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {7415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:04,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:04,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7417#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:04,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {7417#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7418#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:03:04,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {7418#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7419#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:03:04,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {7419#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7408#false} is VALID
[2022-04-08 10:03:04,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:04,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:04,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:04,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:04,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {7408#false} assume !(~y~0 % 4294967296 > 0); {7408#false} is VALID
[2022-04-08 10:03:04,878 INFO L272 TraceCheckUtils]: 20: Hoare triple {7408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7408#false} is VALID
[2022-04-08 10:03:04,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {7408#false} ~cond := #in~cond; {7408#false} is VALID
[2022-04-08 10:03:04,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {7408#false} assume 0 == ~cond; {7408#false} is VALID
[2022-04-08 10:03:04,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {7408#false} assume !false; {7408#false} is VALID
[2022-04-08 10:03:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2022-04-08 10:03:04,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:04,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835304767]
[2022-04-08 10:03:04,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835304767] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:04,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967922252]
[2022-04-08 10:03:04,879 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:03:04,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:04,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:04,880 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:04,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2022-04-08 10:03:04,920 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s)
[2022-04-08 10:03:04,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:04,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core
[2022-04-08 10:03:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:04,929 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:05,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {7407#true} call ULTIMATE.init(); {7407#true} is VALID
[2022-04-08 10:03:05,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {7407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7407#true} is VALID
[2022-04-08 10:03:05,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {7407#true} assume true; {7407#true} is VALID
[2022-04-08 10:03:05,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7407#true} {7407#true} #61#return; {7407#true} is VALID
[2022-04-08 10:03:05,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {7407#true} call #t~ret11 := main(); {7407#true} is VALID
[2022-04-08 10:03:05,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {7407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7412#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:05,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {7412#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:05,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:05,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {7414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:05,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {7415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:05,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:05,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7457#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:05,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {7457#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7461#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:03:05,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {7461#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7465#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:05,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {7465#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7408#false} is VALID
[2022-04-08 10:03:05,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:05,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:05,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:05,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:05,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {7408#false} assume !(~y~0 % 4294967296 > 0); {7408#false} is VALID
[2022-04-08 10:03:05,084 INFO L272 TraceCheckUtils]: 20: Hoare triple {7408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7408#false} is VALID
[2022-04-08 10:03:05,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {7408#false} ~cond := #in~cond; {7408#false} is VALID
[2022-04-08 10:03:05,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {7408#false} assume 0 == ~cond; {7408#false} is VALID
[2022-04-08 10:03:05,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {7408#false} assume !false; {7408#false} is VALID
[2022-04-08 10:03:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2022-04-08 10:03:05,085 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:05,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {7408#false} assume !false; {7408#false} is VALID
[2022-04-08 10:03:05,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {7408#false} assume 0 == ~cond; {7408#false} is VALID
[2022-04-08 10:03:05,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {7408#false} ~cond := #in~cond; {7408#false} is VALID
[2022-04-08 10:03:05,235 INFO L272 TraceCheckUtils]: 20: Hoare triple {7408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7408#false} is VALID
[2022-04-08 10:03:05,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {7408#false} assume !(~y~0 % 4294967296 > 0); {7408#false} is VALID
[2022-04-08 10:03:05,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:05,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {7514#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID
[2022-04-08 10:03:05,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {7518#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7514#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:03:05,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {7522#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7518#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:05,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {7526#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {7522#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:03:05,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {7530#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7526#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID
[2022-04-08 10:03:05,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {7534#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7530#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:05,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {7407#true} ~z~0 := ~y~0; {7534#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID
[2022-04-08 10:03:05,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {7407#true} assume !(~x~0 % 4294967296 > 0); {7407#true} is VALID
[2022-04-08 10:03:05,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {7407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {7407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {7407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {7407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {7407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {7407#true} call #t~ret11 := main(); {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7407#true} {7407#true} #61#return; {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {7407#true} assume true; {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {7407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {7407#true} call ULTIMATE.init(); {7407#true} is VALID
[2022-04-08 10:03:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-04-08 10:03:05,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967922252] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:05,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:05,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20
[2022-04-08 10:03:05,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:05,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [636458825]
[2022-04-08 10:03:05,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [636458825] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:05,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:05,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-04-08 10:03:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152154031]
[2022-04-08 10:03:05,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:05,242 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24
[2022-04-08 10:03:05,242 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:05,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:05,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:05,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-04-08 10:03:05,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:05,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-04-08 10:03:05,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380
[2022-04-08 10:03:05,256 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:05,709 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions.
[2022-04-08 10:03:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-04-08 10:03:05,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24
[2022-04-08 10:03:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions.
[2022-04-08 10:03:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions.
[2022-04-08 10:03:05,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions.
[2022-04-08 10:03:05,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:05,750 INFO L225 Difference]: With dead ends: 71
[2022-04-08 10:03:05,750 INFO L226 Difference]: Without dead ends: 61
[2022-04-08 10:03:05,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756
[2022-04-08 10:03:05,751 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:05,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:03:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2022-04-08 10:03:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55.
[2022-04-08 10:03:05,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:05,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:05,798 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:05,798 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:05,799 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions.
[2022-04-08 10:03:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions.
[2022-04-08 10:03:05,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:05,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:05,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states.
[2022-04-08 10:03:05,799 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states.
[2022-04-08 10:03:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:05,800 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions.
[2022-04-08 10:03:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions.
[2022-04-08 10:03:05,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:05,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:05,800 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:05,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions.
[2022-04-08 10:03:05,801 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 24
[2022-04-08 10:03:05,801 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:05,801 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions.
[2022-04-08 10:03:05,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:05,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions.
[2022-04-08 10:03:07,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions.
[2022-04-08 10:03:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-08 10:03:07,475 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:07,475 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:07,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0
[2022-04-08 10:03:07,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:07,679 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash -101060115, now seen corresponding path program 19 times
[2022-04-08 10:03:07,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:07,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1317652236]
[2022-04-08 10:03:07,684 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:07,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash -101060115, now seen corresponding path program 20 times
[2022-04-08 10:03:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:07,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743866236]
[2022-04-08 10:03:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:07,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:07,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {7980#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7963#true} is VALID
[2022-04-08 10:03:07,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {7963#true} assume true; {7963#true} is VALID
[2022-04-08 10:03:07,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7963#true} {7963#true} #61#return; {7963#true} is VALID
[2022-04-08 10:03:07,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {7963#true} call ULTIMATE.init(); {7980#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:07,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {7980#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7963#true} is VALID
[2022-04-08 10:03:07,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {7963#true} assume true; {7963#true} is VALID
[2022-04-08 10:03:07,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7963#true} {7963#true} #61#return; {7963#true} is VALID
[2022-04-08 10:03:07,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {7963#true} call #t~ret11 := main(); {7963#true} is VALID
[2022-04-08 10:03:07,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {7963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7968#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:07,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {7968#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7969#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:07,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {7969#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7970#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:07,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {7970#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7971#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:07,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {7971#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7972#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:07,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {7972#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7973#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:07,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {7973#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7974#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:07,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {7974#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7975#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:07,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {7975#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7976#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:07,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {7976#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7977#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:07,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {7977#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:07,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:07,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {7979#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:03:07,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {7979#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7964#false} is VALID
[2022-04-08 10:03:07,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {7964#false} assume !(~y~0 % 4294967296 > 0); {7964#false} is VALID
[2022-04-08 10:03:07,877 INFO L272 TraceCheckUtils]: 20: Hoare triple {7964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7964#false} is VALID
[2022-04-08 10:03:07,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {7964#false} ~cond := #in~cond; {7964#false} is VALID
[2022-04-08 10:03:07,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {7964#false} assume 0 == ~cond; {7964#false} is VALID
[2022-04-08 10:03:07,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {7964#false} assume !false; {7964#false} is VALID
[2022-04-08 10:03:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:07,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:07,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743866236]
[2022-04-08 10:03:07,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743866236] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:07,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698893815]
[2022-04-08 10:03:07,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:03:07,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:07,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:07,888 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:07,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2022-04-08 10:03:07,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:03:07,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:07,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core
[2022-04-08 10:03:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:07,928 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:08,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {7963#true} call ULTIMATE.init(); {7963#true} is VALID
[2022-04-08 10:03:08,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {7963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7963#true} is VALID
[2022-04-08 10:03:08,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {7963#true} assume true; {7963#true} is VALID
[2022-04-08 10:03:08,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7963#true} {7963#true} #61#return; {7963#true} is VALID
[2022-04-08 10:03:08,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {7963#true} call #t~ret11 := main(); {7963#true} is VALID
[2022-04-08 10:03:08,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {7963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7968#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:08,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {7968#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7969#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:08,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {7969#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7970#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:08,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {7970#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7971#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:08,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {7971#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7972#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:08,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {7972#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7973#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:08,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {7973#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7974#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:08,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {7974#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7975#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:08,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {7975#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7976#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:08,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {7976#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7977#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:08,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {7977#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:08,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:08,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {8035#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:03:08,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {8035#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7964#false} is VALID
[2022-04-08 10:03:08,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {7964#false} assume !(~y~0 % 4294967296 > 0); {7964#false} is VALID
[2022-04-08 10:03:08,194 INFO L272 TraceCheckUtils]: 20: Hoare triple {7964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7964#false} is VALID
[2022-04-08 10:03:08,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {7964#false} ~cond := #in~cond; {7964#false} is VALID
[2022-04-08 10:03:08,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {7964#false} assume 0 == ~cond; {7964#false} is VALID
[2022-04-08 10:03:08,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {7964#false} assume !false; {7964#false} is VALID
[2022-04-08 10:03:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:08,194 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:08,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {7964#false} assume !false; {7964#false} is VALID
[2022-04-08 10:03:08,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {7964#false} assume 0 == ~cond; {7964#false} is VALID
[2022-04-08 10:03:08,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {7964#false} ~cond := #in~cond; {7964#false} is VALID
[2022-04-08 10:03:08,499 INFO L272 TraceCheckUtils]: 20: Hoare triple {7964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7964#false} is VALID
[2022-04-08 10:03:08,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {7964#false} assume !(~y~0 % 4294967296 > 0); {7964#false} is VALID
[2022-04-08 10:03:08,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {8069#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7964#false} is VALID
[2022-04-08 10:03:08,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {8073#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {8069#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:03:08,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {8073#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8073#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:08,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {8080#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8073#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:08,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {8084#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8080#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:03:08,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {8088#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8084#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:03:08,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {8092#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8088#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:03:08,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {8096#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8092#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:03:08,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {8100#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8096#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:08,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {8104#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8100#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:03:08,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {8108#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8104#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:08,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {8112#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8108#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:03:08,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {8116#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8112#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:03:08,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {7963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8116#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:03:08,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {7963#true} call #t~ret11 := main(); {7963#true} is VALID
[2022-04-08 10:03:08,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7963#true} {7963#true} #61#return; {7963#true} is VALID
[2022-04-08 10:03:08,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {7963#true} assume true; {7963#true} is VALID
[2022-04-08 10:03:08,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {7963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7963#true} is VALID
[2022-04-08 10:03:08,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {7963#true} call ULTIMATE.init(); {7963#true} is VALID
[2022-04-08 10:03:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:08,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698893815] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:08,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:08,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28
[2022-04-08 10:03:08,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:08,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1317652236]
[2022-04-08 10:03:08,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1317652236] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:08,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:08,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-04-08 10:03:08,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474864709]
[2022-04-08 10:03:08,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:08,511 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24
[2022-04-08 10:03:08,511 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:08,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:08,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:08,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-04-08 10:03:08,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:08,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-04-08 10:03:08,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756
[2022-04-08 10:03:08,529 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:09,769 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions.
[2022-04-08 10:03:09,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-04-08 10:03:09,769 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24
[2022-04-08 10:03:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions.
[2022-04-08 10:03:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions.
[2022-04-08 10:03:09,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 87 transitions.
[2022-04-08 10:03:09,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:09,872 INFO L225 Difference]: With dead ends: 77
[2022-04-08 10:03:09,872 INFO L226 Difference]: Without dead ends: 71
[2022-04-08 10:03:09,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560
[2022-04-08 10:03:09,873 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:09,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 92 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:03:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2022-04-08 10:03:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60.
[2022-04-08 10:03:09,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:09,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:09,921 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:09,921 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:09,922 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions.
[2022-04-08 10:03:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions.
[2022-04-08 10:03:09,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:09,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:09,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states.
[2022-04-08 10:03:09,923 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states.
[2022-04-08 10:03:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:09,924 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions.
[2022-04-08 10:03:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions.
[2022-04-08 10:03:09,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:09,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:09,924 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:09,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions.
[2022-04-08 10:03:09,925 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 24
[2022-04-08 10:03:09,925 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:09,925 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions.
[2022-04-08 10:03:09,925 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:09,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 76 transitions.
[2022-04-08 10:03:11,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions.
[2022-04-08 10:03:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 10:03:11,022 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:11,022 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:11,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0
[2022-04-08 10:03:11,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:11,223 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 19 times
[2022-04-08 10:03:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:11,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842974811]
[2022-04-08 10:03:11,225 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:11,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 20 times
[2022-04-08 10:03:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:11,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109947105]
[2022-04-08 10:03:11,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:11,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:11,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:11,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {8591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8577#true} is VALID
[2022-04-08 10:03:11,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {8577#true} assume true; {8577#true} is VALID
[2022-04-08 10:03:11,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8577#true} {8577#true} #61#return; {8577#true} is VALID
[2022-04-08 10:03:11,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {8577#true} call ULTIMATE.init(); {8591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:11,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {8591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8577#true} is VALID
[2022-04-08 10:03:11,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {8577#true} assume true; {8577#true} is VALID
[2022-04-08 10:03:11,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8577#true} {8577#true} #61#return; {8577#true} is VALID
[2022-04-08 10:03:11,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {8577#true} call #t~ret11 := main(); {8577#true} is VALID
[2022-04-08 10:03:11,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {8577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8582#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:11,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {8582#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:11,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {8583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:11,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {8584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:11,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {8585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:11,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:11,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {8587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:11,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {8587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:03:11,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {8588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:03:11,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {8589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:03:11,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {8590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {8578#false} assume !(~y~0 % 4294967296 > 0); {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L272 TraceCheckUtils]: 21: Hoare triple {8578#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {8578#false} ~cond := #in~cond; {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {8578#false} assume 0 == ~cond; {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {8578#false} assume !false; {8578#false} is VALID
[2022-04-08 10:03:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2022-04-08 10:03:11,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:11,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109947105]
[2022-04-08 10:03:11,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109947105] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:11,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882873710]
[2022-04-08 10:03:11,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:03:11,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:11,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:11,374 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:11,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process
[2022-04-08 10:03:11,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:03:11,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:11,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core
[2022-04-08 10:03:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:11,413 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:11,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {8577#true} call ULTIMATE.init(); {8577#true} is VALID
[2022-04-08 10:03:11,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {8577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8577#true} is VALID
[2022-04-08 10:03:11,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {8577#true} assume true; {8577#true} is VALID
[2022-04-08 10:03:11,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8577#true} {8577#true} #61#return; {8577#true} is VALID
[2022-04-08 10:03:11,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {8577#true} call #t~ret11 := main(); {8577#true} is VALID
[2022-04-08 10:03:11,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {8577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8582#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:11,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {8582#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:11,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {8583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:11,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {8584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:11,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {8585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:11,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:11,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {8628#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:11,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {8628#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8632#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:03:11,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {8632#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8636#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:11,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {8636#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8640#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:11,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {8640#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8578#false} is VALID
[2022-04-08 10:03:11,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID
[2022-04-08 10:03:11,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID
[2022-04-08 10:03:11,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID
[2022-04-08 10:03:11,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID
[2022-04-08 10:03:11,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {8578#false} assume !(~y~0 % 4294967296 > 0); {8578#false} is VALID
[2022-04-08 10:03:11,570 INFO L272 TraceCheckUtils]: 21: Hoare triple {8578#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8578#false} is VALID
[2022-04-08 10:03:11,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {8578#false} ~cond := #in~cond; {8578#false} is VALID
[2022-04-08 10:03:11,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {8578#false} assume 0 == ~cond; {8578#false} is VALID
[2022-04-08 10:03:11,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {8578#false} assume !false; {8578#false} is VALID
[2022-04-08 10:03:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2022-04-08 10:03:11,570 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:11,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {8578#false} assume !false; {8578#false} is VALID
[2022-04-08 10:03:11,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {8578#false} assume 0 == ~cond; {8578#false} is VALID
[2022-04-08 10:03:11,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {8578#false} ~cond := #in~cond; {8578#false} is VALID
[2022-04-08 10:03:11,792 INFO L272 TraceCheckUtils]: 21: Hoare triple {8578#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8578#false} is VALID
[2022-04-08 10:03:11,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {8578#false} assume !(~y~0 % 4294967296 > 0); {8578#false} is VALID
[2022-04-08 10:03:11,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {8686#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID
[2022-04-08 10:03:11,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {8690#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8686#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:03:11,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {8694#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8690#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:11,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {8698#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8694#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:03:11,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {8702#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8698#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:03:11,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {8706#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8702#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID
[2022-04-08 10:03:11,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {8710#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8706#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:11,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {8714#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8710#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID
[2022-04-08 10:03:11,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {8577#true} ~z~0 := ~y~0; {8714#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:03:11,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {8577#true} assume !(~x~0 % 4294967296 > 0); {8577#true} is VALID
[2022-04-08 10:03:11,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {8577#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8577#true} is VALID
[2022-04-08 10:03:11,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {8577#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8577#true} is VALID
[2022-04-08 10:03:11,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {8577#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8577#true} is VALID
[2022-04-08 10:03:11,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {8577#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8577#true} is VALID
[2022-04-08 10:03:11,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {8577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8577#true} is VALID
[2022-04-08 10:03:11,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {8577#true} call #t~ret11 := main(); {8577#true} is VALID
[2022-04-08 10:03:11,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8577#true} {8577#true} #61#return; {8577#true} is VALID
[2022-04-08 10:03:11,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {8577#true} assume true; {8577#true} is VALID
[2022-04-08 10:03:11,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {8577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8577#true} is VALID
[2022-04-08 10:03:11,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {8577#true} call ULTIMATE.init(); {8577#true} is VALID
[2022-04-08 10:03:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2022-04-08 10:03:11,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882873710] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:11,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:11,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24
[2022-04-08 10:03:11,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:11,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842974811]
[2022-04-08 10:03:11,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842974811] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:11,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:11,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-04-08 10:03:11,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492128281]
[2022-04-08 10:03:11,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:11,800 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 10:03:11,800 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:11,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:11,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:11,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-04-08 10:03:11,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:11,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-04-08 10:03:11,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552
[2022-04-08 10:03:11,821 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:12,326 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions.
[2022-04-08 10:03:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-04-08 10:03:12,326 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 10:03:12,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions.
[2022-04-08 10:03:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions.
[2022-04-08 10:03:12,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions.
[2022-04-08 10:03:12,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:12,361 INFO L225 Difference]: With dead ends: 77
[2022-04-08 10:03:12,361 INFO L226 Difference]: Without dead ends: 67
[2022-04-08 10:03:12,361 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056
[2022-04-08 10:03:12,362 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:12,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:03:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2022-04-08 10:03:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61.
[2022-04-08 10:03:12,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:12,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:12,416 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:12,417 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:12,418 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions.
[2022-04-08 10:03:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions.
[2022-04-08 10:03:12,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:12,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:12,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states.
[2022-04-08 10:03:12,418 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states.
[2022-04-08 10:03:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:12,420 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions.
[2022-04-08 10:03:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions.
[2022-04-08 10:03:12,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:12,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:12,420 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:12,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions.
[2022-04-08 10:03:12,421 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 25
[2022-04-08 10:03:12,421 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:12,421 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions.
[2022-04-08 10:03:12,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:12,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 77 transitions.
[2022-04-08 10:03:12,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions.
[2022-04-08 10:03:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 10:03:12,784 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:12,784 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:12,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0
[2022-04-08 10:03:12,984 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2022-04-08 10:03:12,984 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash -895834689, now seen corresponding path program 21 times
[2022-04-08 10:03:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:12,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837496990]
[2022-04-08 10:03:12,987 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:12,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash -895834689, now seen corresponding path program 22 times
[2022-04-08 10:03:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:12,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122985799]
[2022-04-08 10:03:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:12,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:13,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:13,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {9194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9181#true} is VALID
[2022-04-08 10:03:13,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {9181#true} assume true; {9181#true} is VALID
[2022-04-08 10:03:13,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9181#true} {9181#true} #61#return; {9181#true} is VALID
[2022-04-08 10:03:13,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {9181#true} call ULTIMATE.init(); {9194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:13,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {9194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9181#true} is VALID
[2022-04-08 10:03:13,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {9181#true} assume true; {9181#true} is VALID
[2022-04-08 10:03:13,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9181#true} {9181#true} #61#return; {9181#true} is VALID
[2022-04-08 10:03:13,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {9181#true} call #t~ret11 := main(); {9181#true} is VALID
[2022-04-08 10:03:13,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {9181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9186#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:13,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {9186#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9187#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:13,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {9187#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9188#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:13,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {9188#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9189#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:13,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {9189#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9190#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:13,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:13,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:13,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:03:13,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {9192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9193#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:03:13,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {9193#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {9182#false} is VALID
[2022-04-08 10:03:13,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {9182#false} assume !(~y~0 % 4294967296 > 0); {9182#false} is VALID
[2022-04-08 10:03:13,114 INFO L272 TraceCheckUtils]: 21: Hoare triple {9182#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9182#false} is VALID
[2022-04-08 10:03:13,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {9182#false} ~cond := #in~cond; {9182#false} is VALID
[2022-04-08 10:03:13,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {9182#false} assume 0 == ~cond; {9182#false} is VALID
[2022-04-08 10:03:13,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {9182#false} assume !false; {9182#false} is VALID
[2022-04-08 10:03:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:13,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122985799]
[2022-04-08 10:03:13,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122985799] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:13,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278616999]
[2022-04-08 10:03:13,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:03:13,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:13,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:13,115 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:13,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2022-04-08 10:03:13,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:03:13,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:13,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core
[2022-04-08 10:03:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:13,154 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:13,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {9181#true} call ULTIMATE.init(); {9181#true} is VALID
[2022-04-08 10:03:13,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {9181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9181#true} is VALID
[2022-04-08 10:03:13,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {9181#true} assume true; {9181#true} is VALID
[2022-04-08 10:03:13,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9181#true} {9181#true} #61#return; {9181#true} is VALID
[2022-04-08 10:03:13,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {9181#true} call #t~ret11 := main(); {9181#true} is VALID
[2022-04-08 10:03:13,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {9181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9186#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:13,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {9186#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9187#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:13,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {9187#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9188#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:13,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {9188#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9189#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:13,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {9189#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9190#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:13,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:13,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:13,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:03:13,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {9192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9237#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:13,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {9237#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {9182#false} is VALID
[2022-04-08 10:03:13,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {9182#false} assume !(~y~0 % 4294967296 > 0); {9182#false} is VALID
[2022-04-08 10:03:13,339 INFO L272 TraceCheckUtils]: 21: Hoare triple {9182#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9182#false} is VALID
[2022-04-08 10:03:13,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {9182#false} ~cond := #in~cond; {9182#false} is VALID
[2022-04-08 10:03:13,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {9182#false} assume 0 == ~cond; {9182#false} is VALID
[2022-04-08 10:03:13,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {9182#false} assume !false; {9182#false} is VALID
[2022-04-08 10:03:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:13,340 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:13,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {9182#false} assume !false; {9182#false} is VALID
[2022-04-08 10:03:13,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {9182#false} assume 0 == ~cond; {9182#false} is VALID
[2022-04-08 10:03:13,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {9182#false} ~cond := #in~cond; {9182#false} is VALID
[2022-04-08 10:03:13,508 INFO L272 TraceCheckUtils]: 21: Hoare triple {9182#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9182#false} is VALID
[2022-04-08 10:03:13,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {9182#false} assume !(~y~0 % 4294967296 > 0); {9182#false} is VALID
[2022-04-08 10:03:13,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID
[2022-04-08 10:03:13,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {9301#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9182#false} is VALID
[2022-04-08 10:03:13,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {9305#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9301#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:03:13,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {9309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {9305#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:03:13,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {9309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:03:13,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {9316#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:03:13,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {9320#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9316#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:13,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {9324#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9320#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:03:13,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {9328#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9324#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:03:13,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {9332#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9328#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:03:13,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {9181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9332#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:03:13,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {9181#true} call #t~ret11 := main(); {9181#true} is VALID
[2022-04-08 10:03:13,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9181#true} {9181#true} #61#return; {9181#true} is VALID
[2022-04-08 10:03:13,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {9181#true} assume true; {9181#true} is VALID
[2022-04-08 10:03:13,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {9181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9181#true} is VALID
[2022-04-08 10:03:13,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {9181#true} call ULTIMATE.init(); {9181#true} is VALID
[2022-04-08 10:03:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:13,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278616999] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:13,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:13,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20
[2022-04-08 10:03:13,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:13,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837496990]
[2022-04-08 10:03:13,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837496990] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:13,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:13,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-04-08 10:03:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207323382]
[2022-04-08 10:03:13,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:13,516 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 10:03:13,516 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:13,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:13,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:13,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-04-08 10:03:13,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-04-08 10:03:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380
[2022-04-08 10:03:13,531 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:14,049 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions.
[2022-04-08 10:03:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-04-08 10:03:14,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 10:03:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions.
[2022-04-08 10:03:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions.
[2022-04-08 10:03:14,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 48 transitions.
[2022-04-08 10:03:14,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:14,091 INFO L225 Difference]: With dead ends: 80
[2022-04-08 10:03:14,091 INFO L226 Difference]: Without dead ends: 69
[2022-04-08 10:03:14,091 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812
[2022-04-08 10:03:14,091 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:14,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 58 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:03:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2022-04-08 10:03:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62.
[2022-04-08 10:03:14,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:14,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:14,146 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:14,147 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:14,147 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions.
[2022-04-08 10:03:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions.
[2022-04-08 10:03:14,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:14,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:14,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states.
[2022-04-08 10:03:14,148 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states.
[2022-04-08 10:03:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:14,149 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions.
[2022-04-08 10:03:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions.
[2022-04-08 10:03:14,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:14,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:14,149 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:14,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions.
[2022-04-08 10:03:14,150 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 25
[2022-04-08 10:03:14,150 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:14,150 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions.
[2022-04-08 10:03:14,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:14,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 78 transitions.
[2022-04-08 10:03:14,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions.
[2022-04-08 10:03:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 10:03:14,719 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:14,719 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:14,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0
[2022-04-08 10:03:14,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2022-04-08 10:03:14,920 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:14,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2014959630, now seen corresponding path program 21 times
[2022-04-08 10:03:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:14,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [391285338]
[2022-04-08 10:03:14,922 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:14,922 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2014959630, now seen corresponding path program 22 times
[2022-04-08 10:03:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:14,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006027923]
[2022-04-08 10:03:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:15,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {9811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9793#true} is VALID
[2022-04-08 10:03:15,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {9793#true} assume true; {9793#true} is VALID
[2022-04-08 10:03:15,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9793#true} {9793#true} #61#return; {9793#true} is VALID
[2022-04-08 10:03:15,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {9793#true} call ULTIMATE.init(); {9811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:15,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {9811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9793#true} is VALID
[2022-04-08 10:03:15,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {9793#true} assume true; {9793#true} is VALID
[2022-04-08 10:03:15,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9793#true} {9793#true} #61#return; {9793#true} is VALID
[2022-04-08 10:03:15,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {9793#true} call #t~ret11 := main(); {9793#true} is VALID
[2022-04-08 10:03:15,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {9793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9798#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:15,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {9798#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:15,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {9799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:15,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {9800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:15,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {9801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:15,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {9802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:15,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {9803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:15,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {9804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:15,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {9805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:15,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {9806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:15,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {9807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:15,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {9808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:03:15,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:03:15,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {9810#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:03:15,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {9810#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9794#false} is VALID
[2022-04-08 10:03:15,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {9794#false} assume !(~y~0 % 4294967296 > 0); {9794#false} is VALID
[2022-04-08 10:03:15,144 INFO L272 TraceCheckUtils]: 21: Hoare triple {9794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9794#false} is VALID
[2022-04-08 10:03:15,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {9794#false} ~cond := #in~cond; {9794#false} is VALID
[2022-04-08 10:03:15,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {9794#false} assume 0 == ~cond; {9794#false} is VALID
[2022-04-08 10:03:15,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {9794#false} assume !false; {9794#false} is VALID
[2022-04-08 10:03:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:15,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:15,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006027923]
[2022-04-08 10:03:15,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006027923] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:15,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406013644]
[2022-04-08 10:03:15,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:03:15,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:15,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:15,146 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:15,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process
[2022-04-08 10:03:15,179 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:03:15,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:15,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core
[2022-04-08 10:03:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:15,186 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:15,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {9793#true} call ULTIMATE.init(); {9793#true} is VALID
[2022-04-08 10:03:15,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {9793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9793#true} is VALID
[2022-04-08 10:03:15,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {9793#true} assume true; {9793#true} is VALID
[2022-04-08 10:03:15,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9793#true} {9793#true} #61#return; {9793#true} is VALID
[2022-04-08 10:03:15,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {9793#true} call #t~ret11 := main(); {9793#true} is VALID
[2022-04-08 10:03:15,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {9793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9798#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:15,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {9798#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:15,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {9799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:15,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {9800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:15,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {9801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:15,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {9802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:15,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {9803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:15,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {9804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:15,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {9805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:15,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {9806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:15,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {9807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:15,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {9808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:03:15,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:03:15,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {9869#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:03:15,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {9869#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9794#false} is VALID
[2022-04-08 10:03:15,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {9794#false} assume !(~y~0 % 4294967296 > 0); {9794#false} is VALID
[2022-04-08 10:03:15,419 INFO L272 TraceCheckUtils]: 21: Hoare triple {9794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9794#false} is VALID
[2022-04-08 10:03:15,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {9794#false} ~cond := #in~cond; {9794#false} is VALID
[2022-04-08 10:03:15,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {9794#false} assume 0 == ~cond; {9794#false} is VALID
[2022-04-08 10:03:15,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {9794#false} assume !false; {9794#false} is VALID
[2022-04-08 10:03:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:15,420 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:15,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {9794#false} assume !false; {9794#false} is VALID
[2022-04-08 10:03:15,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {9794#false} assume 0 == ~cond; {9794#false} is VALID
[2022-04-08 10:03:15,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {9794#false} ~cond := #in~cond; {9794#false} is VALID
[2022-04-08 10:03:15,743 INFO L272 TraceCheckUtils]: 21: Hoare triple {9794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9794#false} is VALID
[2022-04-08 10:03:15,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {9794#false} assume !(~y~0 % 4294967296 > 0); {9794#false} is VALID
[2022-04-08 10:03:15,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {9903#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9794#false} is VALID
[2022-04-08 10:03:15,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {9907#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {9903#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:03:15,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {9907#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9907#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:15,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {9914#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9907#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:15,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {9918#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9914#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:03:15,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {9922#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9918#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:03:15,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {9926#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9922#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:03:15,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {9930#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9926#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:03:15,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {9934#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9930#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:15,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {9938#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9934#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:03:15,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {9942#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9938#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:15,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {9946#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9942#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:03:15,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {9950#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9946#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:03:15,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {9954#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9950#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:03:15,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {9793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9954#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:03:15,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {9793#true} call #t~ret11 := main(); {9793#true} is VALID
[2022-04-08 10:03:15,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9793#true} {9793#true} #61#return; {9793#true} is VALID
[2022-04-08 10:03:15,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {9793#true} assume true; {9793#true} is VALID
[2022-04-08 10:03:15,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {9793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9793#true} is VALID
[2022-04-08 10:03:15,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {9793#true} call ULTIMATE.init(); {9793#true} is VALID
[2022-04-08 10:03:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:15,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406013644] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:15,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:15,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30
[2022-04-08 10:03:15,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:15,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [391285338]
[2022-04-08 10:03:15,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [391285338] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:15,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:15,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-04-08 10:03:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341344635]
[2022-04-08 10:03:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:15,753 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 10:03:15,754 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:15,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:15,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:15,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-04-08 10:03:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:15,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-04-08 10:03:15,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870
[2022-04-08 10:03:15,769 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:17,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:17,112 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions.
[2022-04-08 10:03:17,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-04-08 10:03:17,112 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2022-04-08 10:03:17,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions.
[2022-04-08 10:03:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions.
[2022-04-08 10:03:17,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 94 transitions.
[2022-04-08 10:03:17,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:17,194 INFO L225 Difference]: With dead ends: 85
[2022-04-08 10:03:17,194 INFO L226 Difference]: Without dead ends: 79
[2022-04-08 10:03:17,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806
[2022-04-08 10:03:17,195 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:17,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 100 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:03:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2022-04-08 10:03:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67.
[2022-04-08 10:03:17,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:17,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:17,261 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:17,261 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:17,262 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions.
[2022-04-08 10:03:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions.
[2022-04-08 10:03:17,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:17,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:17,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states.
[2022-04-08 10:03:17,263 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states.
[2022-04-08 10:03:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:17,264 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions.
[2022-04-08 10:03:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions.
[2022-04-08 10:03:17,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:17,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:17,264 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:17,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions.
[2022-04-08 10:03:17,265 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 25
[2022-04-08 10:03:17,265 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:17,265 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions.
[2022-04-08 10:03:17,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:17,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions.
[2022-04-08 10:03:17,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions.
[2022-04-08 10:03:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 10:03:17,682 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:17,682 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:17,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0
[2022-04-08 10:03:17,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:17,883 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 23 times
[2022-04-08 10:03:17,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:17,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479137890]
[2022-04-08 10:03:17,885 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:17,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:17,886 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 24 times
[2022-04-08 10:03:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:17,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876342113]
[2022-04-08 10:03:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:18,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:18,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {10482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10463#true} is VALID
[2022-04-08 10:03:18,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {10463#true} assume true; {10463#true} is VALID
[2022-04-08 10:03:18,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10463#true} {10463#true} #61#return; {10463#true} is VALID
[2022-04-08 10:03:18,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {10463#true} call ULTIMATE.init(); {10482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:18,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {10482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10463#true} is VALID
[2022-04-08 10:03:18,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {10463#true} assume true; {10463#true} is VALID
[2022-04-08 10:03:18,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10463#true} {10463#true} #61#return; {10463#true} is VALID
[2022-04-08 10:03:18,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {10463#true} call #t~ret11 := main(); {10463#true} is VALID
[2022-04-08 10:03:18,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {10463#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10468#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:03:18,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {10468#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10469#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:18,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {10469#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10470#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:03:18,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {10470#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10471#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:18,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {10471#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10472#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:18,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {10472#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10473#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} is VALID
[2022-04-08 10:03:18,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {10473#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} ~z~0 := ~y~0; {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:18,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:18,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID
[2022-04-08 10:03:18,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:18,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:18,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:18,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:18,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID
[2022-04-08 10:03:18,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:18,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:18,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:18,469 INFO L272 TraceCheckUtils]: 22: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10480#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:03:18,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {10480#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10481#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:03:18,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {10481#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10464#false} is VALID
[2022-04-08 10:03:18,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {10464#false} assume !false; {10464#false} is VALID
[2022-04-08 10:03:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:18,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:18,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876342113]
[2022-04-08 10:03:18,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876342113] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:18,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978395173]
[2022-04-08 10:03:18,470 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:03:18,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:18,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:18,471 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:18,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process
[2022-04-08 10:03:18,550 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s)
[2022-04-08 10:03:18,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:18,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 43 conjunts are in the unsatisfiable core
[2022-04-08 10:03:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:18,560 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:40,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {10463#true} call ULTIMATE.init(); {10463#true} is VALID
[2022-04-08 10:03:40,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {10463#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10463#true} is VALID
[2022-04-08 10:03:40,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {10463#true} assume true; {10463#true} is VALID
[2022-04-08 10:03:40,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10463#true} {10463#true} #61#return; {10463#true} is VALID
[2022-04-08 10:03:40,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {10463#true} call #t~ret11 := main(); {10463#true} is VALID
[2022-04-08 10:03:40,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {10463#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10468#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:03:40,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {10468#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10504#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} is VALID
[2022-04-08 10:03:40,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {10504#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10508#(and (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0) (= (+ (- 1) main_~y~0) 1))} is VALID
[2022-04-08 10:03:40,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {10508#(and (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0) (= (+ (- 1) main_~y~0) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10512#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~n~0) (+ main_~x~0 1)))} is VALID
[2022-04-08 10:03:40,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {10512#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~n~0) (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10516#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:03:40,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {10516#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10473#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} is VALID
[2022-04-08 10:03:40,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {10473#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} ~z~0 := ~y~0; {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:40,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:40,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID
[2022-04-08 10:03:40,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:40,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:40,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:40,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:40,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID
[2022-04-08 10:03:40,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID
[2022-04-08 10:03:40,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:40,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:40,054 INFO L272 TraceCheckUtils]: 22: Hoare triple {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:03:40,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {10556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10560#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:03:40,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {10560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10464#false} is VALID
[2022-04-08 10:03:40,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {10464#false} assume !false; {10464#false} is VALID
[2022-04-08 10:03:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:40,055 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:42,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {10464#false} assume !false; {10464#false} is VALID
[2022-04-08 10:03:42,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {10560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10464#false} is VALID
[2022-04-08 10:03:42,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {10556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10560#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:03:42,759 INFO L272 TraceCheckUtils]: 22: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:03:42,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:42,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {10582#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:42,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {10586#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10582#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:42,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {10590#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10586#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:03:42,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {10594#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10590#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:42,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {10594#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {10594#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:03:42,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {10590#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10594#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:03:42,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {10586#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10590#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:42,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {10582#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10586#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:03:42,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10582#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:42,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {10613#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:03:42,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {10617#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {10613#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:03:42,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {10621#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10617#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:03:42,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {10625#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10621#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:03:42,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {10629#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10625#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:03:42,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {10633#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10629#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:03:42,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {10463#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10633#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:03:42,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {10463#true} call #t~ret11 := main(); {10463#true} is VALID
[2022-04-08 10:03:42,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10463#true} {10463#true} #61#return; {10463#true} is VALID
[2022-04-08 10:03:42,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {10463#true} assume true; {10463#true} is VALID
[2022-04-08 10:03:42,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {10463#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10463#true} is VALID
[2022-04-08 10:03:42,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {10463#true} call ULTIMATE.init(); {10463#true} is VALID
[2022-04-08 10:03:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:42,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978395173] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:42,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:42,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33
[2022-04-08 10:03:42,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:42,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1479137890]
[2022-04-08 10:03:42,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1479137890] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:42,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:42,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-04-08 10:03:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108337919]
[2022-04-08 10:03:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:42,776 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 10:03:42,776 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:42,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:42,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:42,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-04-08 10:03:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:42,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-04-08 10:03:42,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056
[2022-04-08 10:03:42,813 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:44,192 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions.
[2022-04-08 10:03:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-04-08 10:03:44,192 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 10:03:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions.
[2022-04-08 10:03:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions.
[2022-04-08 10:03:44,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 46 transitions.
[2022-04-08 10:03:44,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:44,259 INFO L225 Difference]: With dead ends: 86
[2022-04-08 10:03:44,259 INFO L226 Difference]: Without dead ends: 61
[2022-04-08 10:03:44,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=259, Invalid=2191, Unknown=0, NotChecked=0, Total=2450
[2022-04-08 10:03:44,260 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:44,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 74 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:03:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2022-04-08 10:03:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2022-04-08 10:03:44,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:44,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:44,318 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:44,318 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:44,319 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions.
[2022-04-08 10:03:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions.
[2022-04-08 10:03:44,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:44,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:44,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states.
[2022-04-08 10:03:44,320 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states.
[2022-04-08 10:03:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:44,321 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions.
[2022-04-08 10:03:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions.
[2022-04-08 10:03:44,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:44,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:44,321 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:44,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions.
[2022-04-08 10:03:44,322 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 26
[2022-04-08 10:03:44,322 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:44,322 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions.
[2022-04-08 10:03:44,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:44,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 77 transitions.
[2022-04-08 10:03:44,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions.
[2022-04-08 10:03:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 10:03:44,498 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:44,498 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:44,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0
[2022-04-08 10:03:44,698 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:44,699 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 177120127, now seen corresponding path program 25 times
[2022-04-08 10:03:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:44,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [102435835]
[2022-04-08 10:03:44,701 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:44,701 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash 177120127, now seen corresponding path program 26 times
[2022-04-08 10:03:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:44,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754434879]
[2022-04-08 10:03:44,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:44,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {11118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11104#true} is VALID
[2022-04-08 10:03:44,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {11104#true} assume true; {11104#true} is VALID
[2022-04-08 10:03:44,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11104#true} {11104#true} #61#return; {11104#true} is VALID
[2022-04-08 10:03:44,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {11104#true} call ULTIMATE.init(); {11118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:44,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {11118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11104#true} is VALID
[2022-04-08 10:03:44,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {11104#true} assume true; {11104#true} is VALID
[2022-04-08 10:03:44,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11104#true} {11104#true} #61#return; {11104#true} is VALID
[2022-04-08 10:03:44,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {11104#true} call #t~ret11 := main(); {11104#true} is VALID
[2022-04-08 10:03:44,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {11104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11109#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:44,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {11109#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:44,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {11110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:44,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {11111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:44,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {11112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:44,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {11113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:44,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:44,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {11115#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:03:44,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {11115#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:44,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {11116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11117#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:03:44,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {11117#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11105#false} is VALID
[2022-04-08 10:03:44,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:44,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:44,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:44,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:44,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:44,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {11105#false} assume !(~y~0 % 4294967296 > 0); {11105#false} is VALID
[2022-04-08 10:03:44,848 INFO L272 TraceCheckUtils]: 22: Hoare triple {11105#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11105#false} is VALID
[2022-04-08 10:03:44,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {11105#false} ~cond := #in~cond; {11105#false} is VALID
[2022-04-08 10:03:44,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {11105#false} assume 0 == ~cond; {11105#false} is VALID
[2022-04-08 10:03:44,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {11105#false} assume !false; {11105#false} is VALID
[2022-04-08 10:03:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754434879]
[2022-04-08 10:03:44,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754434879] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759588732]
[2022-04-08 10:03:44,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:03:44,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:44,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:44,849 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:44,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process
[2022-04-08 10:03:44,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:03:44,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:44,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-04-08 10:03:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:44,893 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:45,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {11104#true} call ULTIMATE.init(); {11104#true} is VALID
[2022-04-08 10:03:45,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {11104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11104#true} is VALID
[2022-04-08 10:03:45,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {11104#true} assume true; {11104#true} is VALID
[2022-04-08 10:03:45,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11104#true} {11104#true} #61#return; {11104#true} is VALID
[2022-04-08 10:03:45,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {11104#true} call #t~ret11 := main(); {11104#true} is VALID
[2022-04-08 10:03:45,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {11104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11109#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:45,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {11109#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:45,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {11110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:45,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {11111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:45,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {11112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:45,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {11113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:45,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:45,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {11158#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:45,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {11158#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11162#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:03:45,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {11162#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11166#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:45,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {11166#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {11105#false} is VALID
[2022-04-08 10:03:45,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:45,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:45,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:45,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:45,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:45,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {11105#false} assume !(~y~0 % 4294967296 > 0); {11105#false} is VALID
[2022-04-08 10:03:45,067 INFO L272 TraceCheckUtils]: 22: Hoare triple {11105#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11105#false} is VALID
[2022-04-08 10:03:45,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {11105#false} ~cond := #in~cond; {11105#false} is VALID
[2022-04-08 10:03:45,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {11105#false} assume 0 == ~cond; {11105#false} is VALID
[2022-04-08 10:03:45,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {11105#false} assume !false; {11105#false} is VALID
[2022-04-08 10:03:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:45,067 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:45,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {11105#false} assume !false; {11105#false} is VALID
[2022-04-08 10:03:45,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {11105#false} assume 0 == ~cond; {11105#false} is VALID
[2022-04-08 10:03:45,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {11105#false} ~cond := #in~cond; {11105#false} is VALID
[2022-04-08 10:03:45,243 INFO L272 TraceCheckUtils]: 22: Hoare triple {11105#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11105#false} is VALID
[2022-04-08 10:03:45,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {11105#false} assume !(~y~0 % 4294967296 > 0); {11105#false} is VALID
[2022-04-08 10:03:45,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:45,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:45,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {11221#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID
[2022-04-08 10:03:45,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {11225#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11221#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:03:45,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {11229#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11225#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:45,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {11233#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {11229#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:03:45,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {11237#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11233#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID
[2022-04-08 10:03:45,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {11241#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11237#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:45,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {11104#true} ~z~0 := ~y~0; {11241#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID
[2022-04-08 10:03:45,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {11104#true} assume !(~x~0 % 4294967296 > 0); {11104#true} is VALID
[2022-04-08 10:03:45,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {11104#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {11104#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {11104#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {11104#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {11104#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {11104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {11104#true} call #t~ret11 := main(); {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11104#true} {11104#true} #61#return; {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {11104#true} assume true; {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {11104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {11104#true} call ULTIMATE.init(); {11104#true} is VALID
[2022-04-08 10:03:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2022-04-08 10:03:45,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759588732] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:45,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:45,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21
[2022-04-08 10:03:45,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:45,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [102435835]
[2022-04-08 10:03:45,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [102435835] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:45,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:45,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-04-08 10:03:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752511622]
[2022-04-08 10:03:45,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:45,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 10:03:45,251 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:45,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:45,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:45,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-04-08 10:03:45,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:45,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-04-08 10:03:45,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420
[2022-04-08 10:03:45,265 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:45,833 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions.
[2022-04-08 10:03:45,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-04-08 10:03:45,833 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 10:03:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions.
[2022-04-08 10:03:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions.
[2022-04-08 10:03:45,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions.
[2022-04-08 10:03:45,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:45,871 INFO L225 Difference]: With dead ends: 80
[2022-04-08 10:03:45,871 INFO L226 Difference]: Without dead ends: 69
[2022-04-08 10:03:45,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870
[2022-04-08 10:03:45,872 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:45,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:03:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2022-04-08 10:03:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62.
[2022-04-08 10:03:45,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:45,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:45,934 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:45,934 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:45,936 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions.
[2022-04-08 10:03:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions.
[2022-04-08 10:03:45,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:45,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:45,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states.
[2022-04-08 10:03:45,937 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states.
[2022-04-08 10:03:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:45,938 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions.
[2022-04-08 10:03:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions.
[2022-04-08 10:03:45,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:45,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:45,938 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:45,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions.
[2022-04-08 10:03:45,939 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 26
[2022-04-08 10:03:45,939 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:45,939 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions.
[2022-04-08 10:03:45,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:45,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 78 transitions.
[2022-04-08 10:03:46,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions.
[2022-04-08 10:03:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 10:03:46,547 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:46,547 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:46,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0
[2022-04-08 10:03:46,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2022-04-08 10:03:46,748 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1107905011, now seen corresponding path program 23 times
[2022-04-08 10:03:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:46,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [817141296]
[2022-04-08 10:03:46,750 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:46,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1107905011, now seen corresponding path program 24 times
[2022-04-08 10:03:46,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:46,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213252786]
[2022-04-08 10:03:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:46,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {11742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11723#true} is VALID
[2022-04-08 10:03:46,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {11723#true} assume true; {11723#true} is VALID
[2022-04-08 10:03:46,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11723#true} {11723#true} #61#return; {11723#true} is VALID
[2022-04-08 10:03:46,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {11723#true} call ULTIMATE.init(); {11742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:46,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {11742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11723#true} is VALID
[2022-04-08 10:03:46,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {11723#true} assume true; {11723#true} is VALID
[2022-04-08 10:03:46,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11723#true} {11723#true} #61#return; {11723#true} is VALID
[2022-04-08 10:03:46,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {11723#true} call #t~ret11 := main(); {11723#true} is VALID
[2022-04-08 10:03:46,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {11723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11728#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:46,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {11728#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11729#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:46,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {11729#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11730#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:46,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {11730#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11731#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:46,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {11731#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11732#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:46,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {11732#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11733#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:46,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {11733#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11734#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:46,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {11734#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11735#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:46,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {11735#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11736#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:46,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {11736#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11737#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:46,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {11737#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11738#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:46,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {11738#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11739#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:03:46,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {11739#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:03:46,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:03:46,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {11741#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:03:46,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {11741#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11724#false} is VALID
[2022-04-08 10:03:46,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {11724#false} assume !(~y~0 % 4294967296 > 0); {11724#false} is VALID
[2022-04-08 10:03:46,980 INFO L272 TraceCheckUtils]: 22: Hoare triple {11724#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11724#false} is VALID
[2022-04-08 10:03:46,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {11724#false} ~cond := #in~cond; {11724#false} is VALID
[2022-04-08 10:03:46,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {11724#false} assume 0 == ~cond; {11724#false} is VALID
[2022-04-08 10:03:46,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {11724#false} assume !false; {11724#false} is VALID
[2022-04-08 10:03:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:46,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:46,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213252786]
[2022-04-08 10:03:46,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213252786] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:46,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479337191]
[2022-04-08 10:03:46,980 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:03:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:46,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:46,981 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:46,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process
[2022-04-08 10:03:47,059 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2022-04-08 10:03:47,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:47,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 29 conjunts are in the unsatisfiable core
[2022-04-08 10:03:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:47,067 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:47,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {11723#true} call ULTIMATE.init(); {11723#true} is VALID
[2022-04-08 10:03:47,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {11723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11723#true} is VALID
[2022-04-08 10:03:47,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {11723#true} assume true; {11723#true} is VALID
[2022-04-08 10:03:47,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11723#true} {11723#true} #61#return; {11723#true} is VALID
[2022-04-08 10:03:47,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {11723#true} call #t~ret11 := main(); {11723#true} is VALID
[2022-04-08 10:03:47,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {11723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11728#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:47,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {11728#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11729#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:47,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {11729#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11730#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:47,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {11730#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11731#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:47,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {11731#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11732#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:47,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {11732#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11733#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:47,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {11733#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11734#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:47,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {11734#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11735#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:47,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {11735#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11736#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:47,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {11736#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11737#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:47,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {11737#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11738#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:47,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {11738#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11739#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:03:47,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {11739#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:03:47,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:03:47,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {11803#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:03:47,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {11803#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11724#false} is VALID
[2022-04-08 10:03:47,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {11724#false} assume !(~y~0 % 4294967296 > 0); {11724#false} is VALID
[2022-04-08 10:03:47,294 INFO L272 TraceCheckUtils]: 22: Hoare triple {11724#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11724#false} is VALID
[2022-04-08 10:03:47,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {11724#false} ~cond := #in~cond; {11724#false} is VALID
[2022-04-08 10:03:47,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {11724#false} assume 0 == ~cond; {11724#false} is VALID
[2022-04-08 10:03:47,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {11724#false} assume !false; {11724#false} is VALID
[2022-04-08 10:03:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:47,295 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:47,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {11724#false} assume !false; {11724#false} is VALID
[2022-04-08 10:03:47,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {11724#false} assume 0 == ~cond; {11724#false} is VALID
[2022-04-08 10:03:47,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {11724#false} ~cond := #in~cond; {11724#false} is VALID
[2022-04-08 10:03:47,689 INFO L272 TraceCheckUtils]: 22: Hoare triple {11724#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11724#false} is VALID
[2022-04-08 10:03:47,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {11724#false} assume !(~y~0 % 4294967296 > 0); {11724#false} is VALID
[2022-04-08 10:03:47,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {11837#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11724#false} is VALID
[2022-04-08 10:03:47,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {11841#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {11837#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:03:47,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {11841#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11841#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:47,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {11848#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11841#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:47,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {11852#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11848#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:03:47,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {11856#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11852#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:03:47,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {11860#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11856#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:03:47,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {11864#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11860#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:03:47,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {11868#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11864#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:47,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {11872#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11868#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:03:47,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {11876#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11872#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:47,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {11880#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11876#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:03:47,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {11884#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11880#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:03:47,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {11888#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11884#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:03:47,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {11892#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11888#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:03:47,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {11723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11892#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:03:47,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {11723#true} call #t~ret11 := main(); {11723#true} is VALID
[2022-04-08 10:03:47,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11723#true} {11723#true} #61#return; {11723#true} is VALID
[2022-04-08 10:03:47,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {11723#true} assume true; {11723#true} is VALID
[2022-04-08 10:03:47,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {11723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11723#true} is VALID
[2022-04-08 10:03:47,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {11723#true} call ULTIMATE.init(); {11723#true} is VALID
[2022-04-08 10:03:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:47,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479337191] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:47,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:47,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32
[2022-04-08 10:03:47,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:47,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [817141296]
[2022-04-08 10:03:47,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [817141296] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:47,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:47,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-04-08 10:03:47,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460104483]
[2022-04-08 10:03:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:47,700 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 10:03:47,700 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:47,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:47,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:47,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-04-08 10:03:47,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-04-08 10:03:47,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992
[2022-04-08 10:03:47,716 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:49,213 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions.
[2022-04-08 10:03:49,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-04-08 10:03:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2022-04-08 10:03:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions.
[2022-04-08 10:03:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions.
[2022-04-08 10:03:49,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 97 transitions.
[2022-04-08 10:03:49,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:49,296 INFO L225 Difference]: With dead ends: 86
[2022-04-08 10:03:49,296 INFO L226 Difference]: Without dead ends: 80
[2022-04-08 10:03:49,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070
[2022-04-08 10:03:49,297 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:49,297 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 105 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-04-08 10:03:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2022-04-08 10:03:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67.
[2022-04-08 10:03:49,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:49,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:49,379 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:49,394 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:49,395 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions.
[2022-04-08 10:03:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions.
[2022-04-08 10:03:49,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:49,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:49,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states.
[2022-04-08 10:03:49,395 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states.
[2022-04-08 10:03:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:49,396 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions.
[2022-04-08 10:03:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions.
[2022-04-08 10:03:49,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:49,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:49,396 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:49,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions.
[2022-04-08 10:03:49,397 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 26
[2022-04-08 10:03:49,397 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:49,397 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions.
[2022-04-08 10:03:49,397 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:49,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions.
[2022-04-08 10:03:49,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions.
[2022-04-08 10:03:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 10:03:49,851 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:49,851 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:49,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0
[2022-04-08 10:03:50,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2022-04-08 10:03:50,052 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:50,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:50,052 INFO L85 PathProgramCache]: Analyzing trace with hash -921018945, now seen corresponding path program 27 times
[2022-04-08 10:03:50,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:50,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [103062370]
[2022-04-08 10:03:50,055 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:50,055 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash -921018945, now seen corresponding path program 28 times
[2022-04-08 10:03:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:50,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041446795]
[2022-04-08 10:03:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:50,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:50,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {12422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12407#true} is VALID
[2022-04-08 10:03:50,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {12407#true} assume true; {12407#true} is VALID
[2022-04-08 10:03:50,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12407#true} {12407#true} #61#return; {12407#true} is VALID
[2022-04-08 10:03:50,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {12407#true} call ULTIMATE.init(); {12422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:50,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {12422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12407#true} is VALID
[2022-04-08 10:03:50,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {12407#true} assume true; {12407#true} is VALID
[2022-04-08 10:03:50,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12407#true} {12407#true} #61#return; {12407#true} is VALID
[2022-04-08 10:03:50,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {12407#true} call #t~ret11 := main(); {12407#true} is VALID
[2022-04-08 10:03:50,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {12407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12412#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:50,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {12412#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:50,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {12413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:50,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {12414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:50,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {12415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:50,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {12416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:50,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:50,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {12418#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:03:50,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {12418#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12419#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:50,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {12419#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12420#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:03:50,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {12420#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12421#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:03:50,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {12421#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {12408#false} is VALID
[2022-04-08 10:03:50,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {12408#false} assume !(~y~0 % 4294967296 > 0); {12408#false} is VALID
[2022-04-08 10:03:50,199 INFO L272 TraceCheckUtils]: 23: Hoare triple {12408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12408#false} is VALID
[2022-04-08 10:03:50,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {12408#false} ~cond := #in~cond; {12408#false} is VALID
[2022-04-08 10:03:50,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {12408#false} assume 0 == ~cond; {12408#false} is VALID
[2022-04-08 10:03:50,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {12408#false} assume !false; {12408#false} is VALID
[2022-04-08 10:03:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:50,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041446795]
[2022-04-08 10:03:50,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041446795] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413056519]
[2022-04-08 10:03:50,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:03:50,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:50,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:50,200 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:50,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process
[2022-04-08 10:03:50,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:03:50,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:50,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 28 conjunts are in the unsatisfiable core
[2022-04-08 10:03:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:50,241 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:50,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {12407#true} call ULTIMATE.init(); {12407#true} is VALID
[2022-04-08 10:03:50,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {12407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12407#true} is VALID
[2022-04-08 10:03:50,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {12407#true} assume true; {12407#true} is VALID
[2022-04-08 10:03:50,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12407#true} {12407#true} #61#return; {12407#true} is VALID
[2022-04-08 10:03:50,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {12407#true} call #t~ret11 := main(); {12407#true} is VALID
[2022-04-08 10:03:50,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {12407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12412#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:50,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {12412#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:50,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {12413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:50,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {12414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:50,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {12415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:50,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {12416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:50,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:50,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {12462#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:50,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {12462#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12466#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:03:50,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {12466#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12470#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:50,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {12470#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12474#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {12474#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {12408#false} assume !(~y~0 % 4294967296 > 0); {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L272 TraceCheckUtils]: 23: Hoare triple {12408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {12408#false} ~cond := #in~cond; {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {12408#false} assume 0 == ~cond; {12408#false} is VALID
[2022-04-08 10:03:50,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {12408#false} assume !false; {12408#false} is VALID
[2022-04-08 10:03:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:50,477 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:50,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {12408#false} assume !false; {12408#false} is VALID
[2022-04-08 10:03:50,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {12408#false} assume 0 == ~cond; {12408#false} is VALID
[2022-04-08 10:03:50,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {12408#false} ~cond := #in~cond; {12408#false} is VALID
[2022-04-08 10:03:50,699 INFO L272 TraceCheckUtils]: 23: Hoare triple {12408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12408#false} is VALID
[2022-04-08 10:03:50,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {12408#false} assume !(~y~0 % 4294967296 > 0); {12408#false} is VALID
[2022-04-08 10:03:50,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {12526#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID
[2022-04-08 10:03:50,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {12530#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12526#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:03:50,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {12534#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12530#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:50,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {12538#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12534#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:03:50,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {12542#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {12538#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:03:50,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {12546#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12542#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID
[2022-04-08 10:03:50,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {12550#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12546#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:50,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {12554#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12550#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID
[2022-04-08 10:03:50,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {12407#true} ~z~0 := ~y~0; {12554#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:03:50,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {12407#true} assume !(~x~0 % 4294967296 > 0); {12407#true} is VALID
[2022-04-08 10:03:50,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {12407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {12407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {12407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {12407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {12407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {12407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {12407#true} call #t~ret11 := main(); {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12407#true} {12407#true} #61#return; {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {12407#true} assume true; {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {12407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {12407#true} call ULTIMATE.init(); {12407#true} is VALID
[2022-04-08 10:03:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2022-04-08 10:03:50,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413056519] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:50,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:50,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25
[2022-04-08 10:03:50,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:50,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [103062370]
[2022-04-08 10:03:50,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [103062370] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:50,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:50,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-04-08 10:03:50,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826208959]
[2022-04-08 10:03:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:50,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 10:03:50,707 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:50,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:50,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:50,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-04-08 10:03:50,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:50,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-04-08 10:03:50,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600
[2022-04-08 10:03:50,726 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:51,298 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions.
[2022-04-08 10:03:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-04-08 10:03:51,299 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 10:03:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions.
[2022-04-08 10:03:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions.
[2022-04-08 10:03:51,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 45 transitions.
[2022-04-08 10:03:51,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:51,347 INFO L225 Difference]: With dead ends: 86
[2022-04-08 10:03:51,347 INFO L226 Difference]: Without dead ends: 75
[2022-04-08 10:03:51,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190
[2022-04-08 10:03:51,349 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:51,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:03:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2022-04-08 10:03:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68.
[2022-04-08 10:03:51,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:51,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:51,416 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:51,416 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:51,417 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions.
[2022-04-08 10:03:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions.
[2022-04-08 10:03:51,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:51,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:51,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states.
[2022-04-08 10:03:51,417 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states.
[2022-04-08 10:03:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:51,418 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions.
[2022-04-08 10:03:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions.
[2022-04-08 10:03:51,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:51,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:51,418 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:51,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions.
[2022-04-08 10:03:51,419 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 27
[2022-04-08 10:03:51,419 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:51,419 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions.
[2022-04-08 10:03:51,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:51,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 86 transitions.
[2022-04-08 10:03:51,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions.
[2022-04-08 10:03:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 10:03:51,611 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:51,611 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:51,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0
[2022-04-08 10:03:51,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2022-04-08 10:03:51,812 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash 8867439, now seen corresponding path program 29 times
[2022-04-08 10:03:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:51,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624567877]
[2022-04-08 10:03:51,815 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:51,815 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash 8867439, now seen corresponding path program 30 times
[2022-04-08 10:03:51,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:51,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036629505]
[2022-04-08 10:03:51,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:51,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:51,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {13088#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13074#true} is VALID
[2022-04-08 10:03:51,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {13074#true} assume true; {13074#true} is VALID
[2022-04-08 10:03:51,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13074#true} {13074#true} #61#return; {13074#true} is VALID
[2022-04-08 10:03:51,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {13074#true} call ULTIMATE.init(); {13088#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:51,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {13088#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13074#true} is VALID
[2022-04-08 10:03:51,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {13074#true} assume true; {13074#true} is VALID
[2022-04-08 10:03:51,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13074#true} {13074#true} #61#return; {13074#true} is VALID
[2022-04-08 10:03:51,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {13074#true} call #t~ret11 := main(); {13074#true} is VALID
[2022-04-08 10:03:51,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {13074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13079#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:51,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {13079#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:51,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {13080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:51,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {13081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:51,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {13082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:51,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {13083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:51,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {13084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:51,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:51,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13086#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:03:51,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {13086#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13087#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:03:51,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {13087#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13075#false} is VALID
[2022-04-08 10:03:51,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:51,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:51,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:51,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:51,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:51,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:51,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {13075#false} assume !(~y~0 % 4294967296 > 0); {13075#false} is VALID
[2022-04-08 10:03:51,969 INFO L272 TraceCheckUtils]: 23: Hoare triple {13075#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13075#false} is VALID
[2022-04-08 10:03:51,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {13075#false} ~cond := #in~cond; {13075#false} is VALID
[2022-04-08 10:03:51,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {13075#false} assume 0 == ~cond; {13075#false} is VALID
[2022-04-08 10:03:51,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {13075#false} assume !false; {13075#false} is VALID
[2022-04-08 10:03:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:03:51,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:51,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036629505]
[2022-04-08 10:03:51,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036629505] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:51,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602434466]
[2022-04-08 10:03:51,969 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:03:51,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:51,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:51,971 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:51,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process
[2022-04-08 10:03:52,026 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2022-04-08 10:03:52,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:52,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjunts are in the unsatisfiable core
[2022-04-08 10:03:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:52,035 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:52,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {13074#true} call ULTIMATE.init(); {13074#true} is VALID
[2022-04-08 10:03:52,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {13074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13074#true} is VALID
[2022-04-08 10:03:52,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {13074#true} assume true; {13074#true} is VALID
[2022-04-08 10:03:52,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13074#true} {13074#true} #61#return; {13074#true} is VALID
[2022-04-08 10:03:52,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {13074#true} call #t~ret11 := main(); {13074#true} is VALID
[2022-04-08 10:03:52,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {13074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13079#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:52,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {13079#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:52,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {13080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:52,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {13081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:52,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {13082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:52,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {13083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:52,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {13084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:52,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:52,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13086#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:03:52,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {13086#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13134#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:03:52,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {13134#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13075#false} is VALID
[2022-04-08 10:03:52,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {13075#false} assume !(~y~0 % 4294967296 > 0); {13075#false} is VALID
[2022-04-08 10:03:52,232 INFO L272 TraceCheckUtils]: 23: Hoare triple {13075#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13075#false} is VALID
[2022-04-08 10:03:52,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {13075#false} ~cond := #in~cond; {13075#false} is VALID
[2022-04-08 10:03:52,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {13075#false} assume 0 == ~cond; {13075#false} is VALID
[2022-04-08 10:03:52,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {13075#false} assume !false; {13075#false} is VALID
[2022-04-08 10:03:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:03:52,233 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:52,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {13075#false} assume !false; {13075#false} is VALID
[2022-04-08 10:03:52,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {13075#false} assume 0 == ~cond; {13075#false} is VALID
[2022-04-08 10:03:52,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {13075#false} ~cond := #in~cond; {13075#false} is VALID
[2022-04-08 10:03:52,424 INFO L272 TraceCheckUtils]: 23: Hoare triple {13075#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13075#false} is VALID
[2022-04-08 10:03:52,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {13075#false} assume !(~y~0 % 4294967296 > 0); {13075#false} is VALID
[2022-04-08 10:03:52,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID
[2022-04-08 10:03:52,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {13204#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13075#false} is VALID
[2022-04-08 10:03:52,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {13208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13204#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:03:52,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {13212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {13208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:03:52,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {13212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {13212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:03:52,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {13219#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:03:52,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {13223#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13219#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:52,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {13227#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13223#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:03:52,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {13231#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13227#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:03:52,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {13235#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13231#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:03:52,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {13239#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13235#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:03:52,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {13074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13239#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:52,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {13074#true} call #t~ret11 := main(); {13074#true} is VALID
[2022-04-08 10:03:52,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13074#true} {13074#true} #61#return; {13074#true} is VALID
[2022-04-08 10:03:52,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {13074#true} assume true; {13074#true} is VALID
[2022-04-08 10:03:52,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {13074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13074#true} is VALID
[2022-04-08 10:03:52,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {13074#true} call ULTIMATE.init(); {13074#true} is VALID
[2022-04-08 10:03:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:03:52,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602434466] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:52,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:52,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22
[2022-04-08 10:03:52,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:52,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624567877]
[2022-04-08 10:03:52,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624567877] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:52,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:52,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-04-08 10:03:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934092557]
[2022-04-08 10:03:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:52,433 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 10:03:52,433 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:52,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:52,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:52,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-04-08 10:03:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-04-08 10:03:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462
[2022-04-08 10:03:52,447 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:53,020 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions.
[2022-04-08 10:03:53,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-04-08 10:03:53,021 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 10:03:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions.
[2022-04-08 10:03:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions.
[2022-04-08 10:03:53,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 50 transitions.
[2022-04-08 10:03:53,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:53,064 INFO L225 Difference]: With dead ends: 89
[2022-04-08 10:03:53,064 INFO L226 Difference]: Without dead ends: 77
[2022-04-08 10:03:53,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992
[2022-04-08 10:03:53,065 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:53,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:03:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2022-04-08 10:03:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69.
[2022-04-08 10:03:53,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:53,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:53,138 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:53,138 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:53,139 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions.
[2022-04-08 10:03:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions.
[2022-04-08 10:03:53,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:53,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:53,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states.
[2022-04-08 10:03:53,139 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states.
[2022-04-08 10:03:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:53,140 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions.
[2022-04-08 10:03:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions.
[2022-04-08 10:03:53,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:53,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:53,140 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:53,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions.
[2022-04-08 10:03:53,141 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 27
[2022-04-08 10:03:53,141 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:53,141 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions.
[2022-04-08 10:03:53,141 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:53,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 87 transitions.
[2022-04-08 10:03:53,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions.
[2022-04-08 10:03:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 10:03:53,334 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:53,334 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:53,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0
[2022-04-08 10:03:53,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2022-04-08 10:03:53,551 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:53,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash 867538926, now seen corresponding path program 25 times
[2022-04-08 10:03:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:53,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [974117154]
[2022-04-08 10:03:53,554 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:53,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash 867538926, now seen corresponding path program 26 times
[2022-04-08 10:03:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:53,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204054670]
[2022-04-08 10:03:53,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:53,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:53,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13750#true} is VALID
[2022-04-08 10:03:53,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {13750#true} assume true; {13750#true} is VALID
[2022-04-08 10:03:53,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13750#true} {13750#true} #61#return; {13750#true} is VALID
[2022-04-08 10:03:53,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {13750#true} call ULTIMATE.init(); {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:53,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13750#true} is VALID
[2022-04-08 10:03:53,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {13750#true} assume true; {13750#true} is VALID
[2022-04-08 10:03:53,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13750#true} {13750#true} #61#return; {13750#true} is VALID
[2022-04-08 10:03:53,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {13750#true} call #t~ret11 := main(); {13750#true} is VALID
[2022-04-08 10:03:53,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {13750#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13755#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:53,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {13755#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13756#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:53,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {13756#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:53,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {13757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13758#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:53,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {13758#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13759#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:53,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {13759#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:53,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {13760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:53,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {13761#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:53,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {13762#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:53,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {13763#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:53,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {13764#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13765#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:53,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {13765#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13766#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:03:53,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {13766#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13767#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:03:53,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {13767#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:03:53,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:03:53,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {13769#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:03:53,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {13769#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13751#false} is VALID
[2022-04-08 10:03:53,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {13751#false} assume !(~y~0 % 4294967296 > 0); {13751#false} is VALID
[2022-04-08 10:03:53,809 INFO L272 TraceCheckUtils]: 23: Hoare triple {13751#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13751#false} is VALID
[2022-04-08 10:03:53,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {13751#false} ~cond := #in~cond; {13751#false} is VALID
[2022-04-08 10:03:53,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {13751#false} assume 0 == ~cond; {13751#false} is VALID
[2022-04-08 10:03:53,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {13751#false} assume !false; {13751#false} is VALID
[2022-04-08 10:03:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:53,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:53,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204054670]
[2022-04-08 10:03:53,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204054670] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:53,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762487449]
[2022-04-08 10:03:53,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:03:53,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:53,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:53,811 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:53,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process
[2022-04-08 10:03:53,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:03:53,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:53,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core
[2022-04-08 10:03:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:53,854 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:54,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {13750#true} call ULTIMATE.init(); {13750#true} is VALID
[2022-04-08 10:03:54,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {13750#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13750#true} is VALID
[2022-04-08 10:03:54,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {13750#true} assume true; {13750#true} is VALID
[2022-04-08 10:03:54,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13750#true} {13750#true} #61#return; {13750#true} is VALID
[2022-04-08 10:03:54,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {13750#true} call #t~ret11 := main(); {13750#true} is VALID
[2022-04-08 10:03:54,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {13750#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13755#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:54,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {13755#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13756#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:54,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {13756#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:54,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {13757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13758#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:54,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {13758#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13759#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:54,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {13759#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:54,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {13760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:03:54,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {13761#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:03:54,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {13762#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:03:54,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {13763#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:03:54,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {13764#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13765#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:03:54,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {13765#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13766#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:03:54,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {13766#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13767#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:03:54,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {13767#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:03:54,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:03:54,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {13834#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID
[2022-04-08 10:03:54,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {13834#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {13751#false} is VALID
[2022-04-08 10:03:54,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {13751#false} assume !(~y~0 % 4294967296 > 0); {13751#false} is VALID
[2022-04-08 10:03:54,133 INFO L272 TraceCheckUtils]: 23: Hoare triple {13751#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13751#false} is VALID
[2022-04-08 10:03:54,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {13751#false} ~cond := #in~cond; {13751#false} is VALID
[2022-04-08 10:03:54,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {13751#false} assume 0 == ~cond; {13751#false} is VALID
[2022-04-08 10:03:54,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {13751#false} assume !false; {13751#false} is VALID
[2022-04-08 10:03:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:54,134 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:54,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {13751#false} assume !false; {13751#false} is VALID
[2022-04-08 10:03:54,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {13751#false} assume 0 == ~cond; {13751#false} is VALID
[2022-04-08 10:03:54,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {13751#false} ~cond := #in~cond; {13751#false} is VALID
[2022-04-08 10:03:54,560 INFO L272 TraceCheckUtils]: 23: Hoare triple {13751#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13751#false} is VALID
[2022-04-08 10:03:54,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {13751#false} assume !(~y~0 % 4294967296 > 0); {13751#false} is VALID
[2022-04-08 10:03:54,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {13868#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13751#false} is VALID
[2022-04-08 10:03:54,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {13872#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {13868#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:03:54,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {13872#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {13872#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:54,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {13879#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13872#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:03:54,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {13883#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13879#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:03:54,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {13887#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13883#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:03:54,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {13891#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13887#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:03:54,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {13895#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13891#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:03:54,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {13899#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13895#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:54,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {13903#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13899#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:03:54,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {13907#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13903#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:03:54,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {13911#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13907#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:03:54,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {13915#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13911#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:03:54,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {13919#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13915#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:03:54,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {13923#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13919#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:03:54,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {13927#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13923#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:03:54,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {13750#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13927#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:03:54,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {13750#true} call #t~ret11 := main(); {13750#true} is VALID
[2022-04-08 10:03:54,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13750#true} {13750#true} #61#return; {13750#true} is VALID
[2022-04-08 10:03:54,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {13750#true} assume true; {13750#true} is VALID
[2022-04-08 10:03:54,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {13750#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13750#true} is VALID
[2022-04-08 10:03:54,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {13750#true} call ULTIMATE.init(); {13750#true} is VALID
[2022-04-08 10:03:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:03:54,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762487449] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:54,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:54,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34
[2022-04-08 10:03:54,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:54,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [974117154]
[2022-04-08 10:03:54,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [974117154] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:54,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:54,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-04-08 10:03:54,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320258453]
[2022-04-08 10:03:54,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 10:03:54,573 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:54,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:54,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:54,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-04-08 10:03:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-04-08 10:03:54,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122
[2022-04-08 10:03:54,590 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:56,345 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions.
[2022-04-08 10:03:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2022-04-08 10:03:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27
[2022-04-08 10:03:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 104 transitions.
[2022-04-08 10:03:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 104 transitions.
[2022-04-08 10:03:56,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 104 transitions.
[2022-04-08 10:03:56,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:56,441 INFO L225 Difference]: With dead ends: 94
[2022-04-08 10:03:56,441 INFO L226 Difference]: Without dead ends: 88
[2022-04-08 10:03:56,441 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352
[2022-04-08 10:03:56,442 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:56,442 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 113 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-04-08 10:03:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2022-04-08 10:03:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74.
[2022-04-08 10:03:56,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:56,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:56,513 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:56,513 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:56,514 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions.
[2022-04-08 10:03:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions.
[2022-04-08 10:03:56,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:56,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:56,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states.
[2022-04-08 10:03:56,514 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states.
[2022-04-08 10:03:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:56,515 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions.
[2022-04-08 10:03:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions.
[2022-04-08 10:03:56,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:56,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:56,515 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:56,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions.
[2022-04-08 10:03:56,516 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 27
[2022-04-08 10:03:56,516 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:56,516 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions.
[2022-04-08 10:03:56,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:56,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 94 transitions.
[2022-04-08 10:03:57,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions.
[2022-04-08 10:03:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 10:03:57,360 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:03:57,360 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:03:57,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0
[2022-04-08 10:03:57,560 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2022-04-08 10:03:57,561 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:03:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:03:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 31 times
[2022-04-08 10:03:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:57,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [940692393]
[2022-04-08 10:03:57,577 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:03:57,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:03:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 32 times
[2022-04-08 10:03:57,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:03:57,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449486978]
[2022-04-08 10:03:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:03:57,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:03:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:57,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:03:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:57,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {14506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14490#true} is VALID
[2022-04-08 10:03:57,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {14490#true} assume true; {14490#true} is VALID
[2022-04-08 10:03:57,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14490#true} {14490#true} #61#return; {14490#true} is VALID
[2022-04-08 10:03:57,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {14490#true} call ULTIMATE.init(); {14506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:03:57,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {14506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14490#true} is VALID
[2022-04-08 10:03:57,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {14490#true} assume true; {14490#true} is VALID
[2022-04-08 10:03:57,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14490#true} {14490#true} #61#return; {14490#true} is VALID
[2022-04-08 10:03:57,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {14490#true} call #t~ret11 := main(); {14490#true} is VALID
[2022-04-08 10:03:57,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {14490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14495#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:57,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {14495#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:57,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {14496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:57,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {14497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:57,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {14498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:57,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {14499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:57,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:57,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {14501#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:03:57,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {14501#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14502#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:03:57,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {14502#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14503#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:03:57,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {14503#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14504#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:03:57,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {14504#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14505#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {14505#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {14491#false} assume !(~y~0 % 4294967296 > 0); {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L272 TraceCheckUtils]: 24: Hoare triple {14491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {14491#false} ~cond := #in~cond; {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {14491#false} assume 0 == ~cond; {14491#false} is VALID
[2022-04-08 10:03:57,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {14491#false} assume !false; {14491#false} is VALID
[2022-04-08 10:03:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:03:57,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449486978]
[2022-04-08 10:03:57,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449486978] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:03:57,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395709272]
[2022-04-08 10:03:57,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:03:57,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:03:57,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:03:57,758 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:03:57,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process
[2022-04-08 10:03:57,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:03:57,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:03:57,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core
[2022-04-08 10:03:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:03:57,816 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:03:58,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {14490#true} call ULTIMATE.init(); {14490#true} is VALID
[2022-04-08 10:03:58,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {14490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14490#true} is VALID
[2022-04-08 10:03:58,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {14490#true} assume true; {14490#true} is VALID
[2022-04-08 10:03:58,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14490#true} {14490#true} #61#return; {14490#true} is VALID
[2022-04-08 10:03:58,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {14490#true} call #t~ret11 := main(); {14490#true} is VALID
[2022-04-08 10:03:58,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {14490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14495#(= main_~y~0 0)} is VALID
[2022-04-08 10:03:58,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {14495#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:03:58,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {14496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:03:58,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {14497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:03:58,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {14498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:03:58,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {14499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:58,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:58,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {14546#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:58,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {14546#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14550#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:03:58,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {14550#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14554#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:58,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {14554#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14558#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:58,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {14558#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14562#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {14562#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {14491#false} assume !(~y~0 % 4294967296 > 0); {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L272 TraceCheckUtils]: 24: Hoare triple {14491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {14491#false} ~cond := #in~cond; {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {14491#false} assume 0 == ~cond; {14491#false} is VALID
[2022-04-08 10:03:58,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {14491#false} assume !false; {14491#false} is VALID
[2022-04-08 10:03:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:58,032 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:03:58,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {14491#false} assume !false; {14491#false} is VALID
[2022-04-08 10:03:58,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {14491#false} assume 0 == ~cond; {14491#false} is VALID
[2022-04-08 10:03:58,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {14491#false} ~cond := #in~cond; {14491#false} is VALID
[2022-04-08 10:03:58,309 INFO L272 TraceCheckUtils]: 24: Hoare triple {14491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14491#false} is VALID
[2022-04-08 10:03:58,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {14491#false} assume !(~y~0 % 4294967296 > 0); {14491#false} is VALID
[2022-04-08 10:03:58,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {14611#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID
[2022-04-08 10:03:58,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {14615#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14611#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:03:58,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {14619#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14615#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:03:58,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {14623#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14619#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:03:58,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {14627#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14623#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:03:58,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {14631#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14627#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:03:58,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {14635#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14631#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:03:58,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {14639#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14635#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:03:58,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {14643#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14639#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:03:58,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {14647#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14643#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:03:58,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {14490#true} ~z~0 := ~y~0; {14647#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:03:58,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {14490#true} assume !(~x~0 % 4294967296 > 0); {14490#true} is VALID
[2022-04-08 10:03:58,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {14490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14490#true} is VALID
[2022-04-08 10:03:58,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {14490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14490#true} is VALID
[2022-04-08 10:03:58,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {14490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14490#true} is VALID
[2022-04-08 10:03:58,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {14490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14490#true} is VALID
[2022-04-08 10:03:58,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {14490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14490#true} is VALID
[2022-04-08 10:03:58,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {14490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14490#true} is VALID
[2022-04-08 10:03:58,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {14490#true} call #t~ret11 := main(); {14490#true} is VALID
[2022-04-08 10:03:58,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14490#true} {14490#true} #61#return; {14490#true} is VALID
[2022-04-08 10:03:58,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {14490#true} assume true; {14490#true} is VALID
[2022-04-08 10:03:58,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {14490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14490#true} is VALID
[2022-04-08 10:03:58,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {14490#true} call ULTIMATE.init(); {14490#true} is VALID
[2022-04-08 10:03:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-08 10:03:58,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395709272] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:03:58,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:03:58,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 29
[2022-04-08 10:03:58,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:03:58,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [940692393]
[2022-04-08 10:03:58,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [940692393] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:03:58,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:03:58,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-04-08 10:03:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926781872]
[2022-04-08 10:03:58,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:03:58,318 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 10:03:58,318 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:03:58,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:58,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:58,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-04-08 10:03:58,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:03:58,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-04-08 10:03:58,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812
[2022-04-08 10:03:58,338 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:58,996 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions.
[2022-04-08 10:03:58,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-04-08 10:03:58,996 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 10:03:58,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:03:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions.
[2022-04-08 10:03:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions.
[2022-04-08 10:03:58,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 46 transitions.
[2022-04-08 10:03:59,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:03:59,047 INFO L225 Difference]: With dead ends: 93
[2022-04-08 10:03:59,047 INFO L226 Difference]: Without dead ends: 82
[2022-04-08 10:03:59,048 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560
[2022-04-08 10:03:59,048 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:03:59,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:03:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2022-04-08 10:03:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75.
[2022-04-08 10:03:59,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:03:59,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:59,118 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:59,118 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:59,118 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions.
[2022-04-08 10:03:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions.
[2022-04-08 10:03:59,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:59,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:59,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states.
[2022-04-08 10:03:59,119 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states.
[2022-04-08 10:03:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:03:59,120 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions.
[2022-04-08 10:03:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions.
[2022-04-08 10:03:59,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:03:59,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:03:59,120 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:03:59,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:03:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions.
[2022-04-08 10:03:59,121 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 28
[2022-04-08 10:03:59,121 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:03:59,121 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions.
[2022-04-08 10:03:59,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:03:59,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 95 transitions.
[2022-04-08 10:04:00,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions.
[2022-04-08 10:04:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 10:04:00,279 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:04:00,279 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:04:00,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0
[2022-04-08 10:04:00,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:00,480 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:04:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:04:00,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1955495667, now seen corresponding path program 33 times
[2022-04-08 10:04:00,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:00,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966628400]
[2022-04-08 10:04:00,486 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:04:00,486 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:04:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1955495667, now seen corresponding path program 34 times
[2022-04-08 10:04:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:04:00,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888428807]
[2022-04-08 10:04:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:04:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:04:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:00,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:04:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:00,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {15226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15211#true} is VALID
[2022-04-08 10:04:00,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {15211#true} assume true; {15211#true} is VALID
[2022-04-08 10:04:00,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15211#true} {15211#true} #61#return; {15211#true} is VALID
[2022-04-08 10:04:00,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {15211#true} call ULTIMATE.init(); {15226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:04:00,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {15226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15211#true} is VALID
[2022-04-08 10:04:00,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {15211#true} assume true; {15211#true} is VALID
[2022-04-08 10:04:00,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15211#true} {15211#true} #61#return; {15211#true} is VALID
[2022-04-08 10:04:00,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {15211#true} call #t~ret11 := main(); {15211#true} is VALID
[2022-04-08 10:04:00,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {15211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15216#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:00,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {15216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:00,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {15217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:00,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {15218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:00,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {15219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:00,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {15220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:00,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {15221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:00,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:00,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {15223#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:04:00,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {15223#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15224#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:04:00,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {15224#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15225#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:04:00,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {15225#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15212#false} is VALID
[2022-04-08 10:04:00,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {15212#false} assume !(~y~0 % 4294967296 > 0); {15212#false} is VALID
[2022-04-08 10:04:00,644 INFO L272 TraceCheckUtils]: 24: Hoare triple {15212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15212#false} is VALID
[2022-04-08 10:04:00,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {15212#false} ~cond := #in~cond; {15212#false} is VALID
[2022-04-08 10:04:00,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {15212#false} assume 0 == ~cond; {15212#false} is VALID
[2022-04-08 10:04:00,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {15212#false} assume !false; {15212#false} is VALID
[2022-04-08 10:04:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:04:00,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:04:00,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888428807]
[2022-04-08 10:04:00,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888428807] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:04:00,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206375374]
[2022-04-08 10:04:00,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:04:00,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:00,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:04:00,660 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:04:00,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process
[2022-04-08 10:04:00,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:04:00,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:04:00,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 21 conjunts are in the unsatisfiable core
[2022-04-08 10:04:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:00,701 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:04:00,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {15211#true} call ULTIMATE.init(); {15211#true} is VALID
[2022-04-08 10:04:00,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {15211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15211#true} is VALID
[2022-04-08 10:04:00,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {15211#true} assume true; {15211#true} is VALID
[2022-04-08 10:04:00,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15211#true} {15211#true} #61#return; {15211#true} is VALID
[2022-04-08 10:04:00,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {15211#true} call #t~ret11 := main(); {15211#true} is VALID
[2022-04-08 10:04:00,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {15211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15216#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:00,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {15216#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:00,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {15217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:00,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {15218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:00,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {15219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:00,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {15220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:00,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {15221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:00,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:00,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {15223#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:04:00,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {15223#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15224#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:04:00,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {15224#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15275#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {15275#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {15212#false} assume !(~y~0 % 4294967296 > 0); {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L272 TraceCheckUtils]: 24: Hoare triple {15212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {15212#false} ~cond := #in~cond; {15212#false} is VALID
[2022-04-08 10:04:00,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {15212#false} assume 0 == ~cond; {15212#false} is VALID
[2022-04-08 10:04:00,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {15212#false} assume !false; {15212#false} is VALID
[2022-04-08 10:04:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:04:00,911 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:04:01,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {15212#false} assume !false; {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {15212#false} assume 0 == ~cond; {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {15212#false} ~cond := #in~cond; {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L272 TraceCheckUtils]: 24: Hoare triple {15212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {15212#false} assume !(~y~0 % 4294967296 > 0); {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID
[2022-04-08 10:04:01,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {15345#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15212#false} is VALID
[2022-04-08 10:04:01,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {15349#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15345#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:04:01,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {15353#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15349#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:04:01,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {15357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {15353#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:04:01,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {15357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {15357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:04:01,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {15364#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:04:01,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {15368#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15364#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:04:01,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {15372#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15368#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:04:01,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {15376#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15372#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:04:01,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {15380#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15376#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:04:01,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {15384#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15380#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:04:01,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {15211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15384#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:04:01,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {15211#true} call #t~ret11 := main(); {15211#true} is VALID
[2022-04-08 10:04:01,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15211#true} {15211#true} #61#return; {15211#true} is VALID
[2022-04-08 10:04:01,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {15211#true} assume true; {15211#true} is VALID
[2022-04-08 10:04:01,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {15211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15211#true} is VALID
[2022-04-08 10:04:01,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {15211#true} call ULTIMATE.init(); {15211#true} is VALID
[2022-04-08 10:04:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:04:01,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206375374] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:04:01,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:04:01,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24
[2022-04-08 10:04:01,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:04:01,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966628400]
[2022-04-08 10:04:01,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966628400] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:04:01,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:04:01,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-04-08 10:04:01,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496252042]
[2022-04-08 10:04:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:04:01,164 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 10:04:01,164 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:04:01,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:01,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:01,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-04-08 10:04:01,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:01,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-04-08 10:04:01,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552
[2022-04-08 10:04:01,178 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:01,884 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions.
[2022-04-08 10:04:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-04-08 10:04:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 10:04:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:04:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions.
[2022-04-08 10:04:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions.
[2022-04-08 10:04:01,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 52 transitions.
[2022-04-08 10:04:01,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:01,925 INFO L225 Difference]: With dead ends: 96
[2022-04-08 10:04:01,925 INFO L226 Difference]: Without dead ends: 84
[2022-04-08 10:04:01,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260
[2022-04-08 10:04:01,926 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:04:01,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:04:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2022-04-08 10:04:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76.
[2022-04-08 10:04:02,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:04:02,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:02,008 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:02,008 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:02,009 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions.
[2022-04-08 10:04:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions.
[2022-04-08 10:04:02,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:02,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:02,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states.
[2022-04-08 10:04:02,010 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states.
[2022-04-08 10:04:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:02,010 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions.
[2022-04-08 10:04:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions.
[2022-04-08 10:04:02,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:02,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:02,011 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:04:02,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:04:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions.
[2022-04-08 10:04:02,011 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 28
[2022-04-08 10:04:02,012 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:04:02,012 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions.
[2022-04-08 10:04:02,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:02,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 96 transitions.
[2022-04-08 10:04:03,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions.
[2022-04-08 10:04:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 10:04:03,193 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:04:03,193 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:04:03,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0
[2022-04-08 10:04:03,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30
[2022-04-08 10:04:03,400 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:04:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:04:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1976758829, now seen corresponding path program 27 times
[2022-04-08 10:04:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:03,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1979434278]
[2022-04-08 10:04:03,402 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:04:03,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:04:03,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1976758829, now seen corresponding path program 28 times
[2022-04-08 10:04:03,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:04:03,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460819598]
[2022-04-08 10:04:03,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:04:03,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:04:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:04:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:03,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {15962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15941#true} is VALID
[2022-04-08 10:04:03,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {15941#true} assume true; {15941#true} is VALID
[2022-04-08 10:04:03,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15941#true} {15941#true} #61#return; {15941#true} is VALID
[2022-04-08 10:04:03,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {15941#true} call ULTIMATE.init(); {15962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:04:03,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {15962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15941#true} is VALID
[2022-04-08 10:04:03,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {15941#true} assume true; {15941#true} is VALID
[2022-04-08 10:04:03,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15941#true} {15941#true} #61#return; {15941#true} is VALID
[2022-04-08 10:04:03,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {15941#true} call #t~ret11 := main(); {15941#true} is VALID
[2022-04-08 10:04:03,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {15941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15946#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:03,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {15946#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:03,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {15947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:03,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {15948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:03,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {15949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:03,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {15950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:03,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {15951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:03,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {15952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:03,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {15953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:04:03,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {15954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:04:03,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {15955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:04:03,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {15956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:04:03,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {15957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:04:03,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {15958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:04:03,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {15959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:04:03,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:04:03,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {15961#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:04:03,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {15961#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15942#false} is VALID
[2022-04-08 10:04:03,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {15942#false} assume !(~y~0 % 4294967296 > 0); {15942#false} is VALID
[2022-04-08 10:04:03,661 INFO L272 TraceCheckUtils]: 24: Hoare triple {15942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15942#false} is VALID
[2022-04-08 10:04:03,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {15942#false} ~cond := #in~cond; {15942#false} is VALID
[2022-04-08 10:04:03,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {15942#false} assume 0 == ~cond; {15942#false} is VALID
[2022-04-08 10:04:03,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {15942#false} assume !false; {15942#false} is VALID
[2022-04-08 10:04:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:04:03,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:04:03,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460819598]
[2022-04-08 10:04:03,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460819598] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:04:03,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784428010]
[2022-04-08 10:04:03,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:04:03,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:04:03,663 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:04:03,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process
[2022-04-08 10:04:03,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:04:03,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:04:03,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjunts are in the unsatisfiable core
[2022-04-08 10:04:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:03,706 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:04:03,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {15941#true} call ULTIMATE.init(); {15941#true} is VALID
[2022-04-08 10:04:03,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {15941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15941#true} is VALID
[2022-04-08 10:04:03,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {15941#true} assume true; {15941#true} is VALID
[2022-04-08 10:04:03,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15941#true} {15941#true} #61#return; {15941#true} is VALID
[2022-04-08 10:04:03,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {15941#true} call #t~ret11 := main(); {15941#true} is VALID
[2022-04-08 10:04:03,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {15941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15946#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:03,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {15946#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:03,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {15947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:03,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {15948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:03,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {15949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:03,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {15950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:03,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {15951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:03,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {15952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:03,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {15953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:04:03,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {15954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:04:03,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {15955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:04:03,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {15956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:04:03,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {15957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:04:03,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {15958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:04:03,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {15959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:04:03,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:04:03,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {16029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID
[2022-04-08 10:04:03,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {16029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {15942#false} is VALID
[2022-04-08 10:04:03,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {15942#false} assume !(~y~0 % 4294967296 > 0); {15942#false} is VALID
[2022-04-08 10:04:03,997 INFO L272 TraceCheckUtils]: 24: Hoare triple {15942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15942#false} is VALID
[2022-04-08 10:04:03,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {15942#false} ~cond := #in~cond; {15942#false} is VALID
[2022-04-08 10:04:03,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {15942#false} assume 0 == ~cond; {15942#false} is VALID
[2022-04-08 10:04:03,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {15942#false} assume !false; {15942#false} is VALID
[2022-04-08 10:04:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:04:03,998 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:04:04,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {15942#false} assume !false; {15942#false} is VALID
[2022-04-08 10:04:04,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {15942#false} assume 0 == ~cond; {15942#false} is VALID
[2022-04-08 10:04:04,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {15942#false} ~cond := #in~cond; {15942#false} is VALID
[2022-04-08 10:04:04,459 INFO L272 TraceCheckUtils]: 24: Hoare triple {15942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15942#false} is VALID
[2022-04-08 10:04:04,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {15942#false} assume !(~y~0 % 4294967296 > 0); {15942#false} is VALID
[2022-04-08 10:04:04,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {16063#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15942#false} is VALID
[2022-04-08 10:04:04,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {16067#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {16063#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:04:04,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {16067#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16067#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:04:04,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {16074#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16067#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:04:04,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {16078#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16074#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:04:04,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {16082#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16078#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:04:04,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {16086#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16082#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:04:04,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {16090#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16086#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:04:04,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {16094#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16090#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:04:04,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {16098#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16094#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:04:04,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {16102#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16098#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:04:04,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {16106#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16102#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:04:04,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {16110#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16106#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:04:04,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {16114#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16110#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:04:04,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {16118#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16114#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:04:04,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {16122#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16118#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:04:04,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {16126#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16122#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:04:04,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {15941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16126#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:04:04,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {15941#true} call #t~ret11 := main(); {15941#true} is VALID
[2022-04-08 10:04:04,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15941#true} {15941#true} #61#return; {15941#true} is VALID
[2022-04-08 10:04:04,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {15941#true} assume true; {15941#true} is VALID
[2022-04-08 10:04:04,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {15941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15941#true} is VALID
[2022-04-08 10:04:04,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {15941#true} call ULTIMATE.init(); {15941#true} is VALID
[2022-04-08 10:04:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:04:04,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784428010] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:04:04,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:04:04,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36
[2022-04-08 10:04:04,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:04:04,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1979434278]
[2022-04-08 10:04:04,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1979434278] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:04:04,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:04:04,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2022-04-08 10:04:04,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934991397]
[2022-04-08 10:04:04,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:04:04,471 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 10:04:04,471 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:04:04,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:04,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:04,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-08 10:04:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:04,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-08 10:04:04,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260
[2022-04-08 10:04:04,489 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:06,484 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions.
[2022-04-08 10:04:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2022-04-08 10:04:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2022-04-08 10:04:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:04:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions.
[2022-04-08 10:04:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions.
[2022-04-08 10:04:06,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 111 transitions.
[2022-04-08 10:04:06,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:06,592 INFO L225 Difference]: With dead ends: 102
[2022-04-08 10:04:06,592 INFO L226 Difference]: Without dead ends: 96
[2022-04-08 10:04:06,593 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652
[2022-04-08 10:04:06,594 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-04-08 10:04:06,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 121 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-04-08 10:04:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2022-04-08 10:04:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81.
[2022-04-08 10:04:06,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:04:06,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:06,675 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:06,675 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:06,677 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions.
[2022-04-08 10:04:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions.
[2022-04-08 10:04:06,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:06,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:06,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states.
[2022-04-08 10:04:06,677 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states.
[2022-04-08 10:04:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:06,678 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions.
[2022-04-08 10:04:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions.
[2022-04-08 10:04:06,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:06,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:06,679 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:04:06,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:04:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions.
[2022-04-08 10:04:06,680 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 28
[2022-04-08 10:04:06,680 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:04:06,680 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions.
[2022-04-08 10:04:06,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:06,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 103 transitions.
[2022-04-08 10:04:07,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions.
[2022-04-08 10:04:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 10:04:07,035 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:04:07,035 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:04:07,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0
[2022-04-08 10:04:07,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:07,251 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:04:07,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:04:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 35 times
[2022-04-08 10:04:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:07,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1370802565]
[2022-04-08 10:04:07,254 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:04:07,254 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:04:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 36 times
[2022-04-08 10:04:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:04:07,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132639727]
[2022-04-08 10:04:07,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:04:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:04:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:07,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:04:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:07,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {16758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID
[2022-04-08 10:04:07,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} assume true; {16737#true} is VALID
[2022-04-08 10:04:07,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16737#true} {16737#true} #61#return; {16737#true} is VALID
[2022-04-08 10:04:07,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} call ULTIMATE.init(); {16758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:04:07,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {16758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID
[2022-04-08 10:04:07,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} assume true; {16737#true} is VALID
[2022-04-08 10:04:07,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} #61#return; {16737#true} is VALID
[2022-04-08 10:04:07,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} call #t~ret11 := main(); {16737#true} is VALID
[2022-04-08 10:04:07,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16742#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:04:07,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {16742#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16743#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:08,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {16743#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16744#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:04:08,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {16744#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16745#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:08,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {16745#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16746#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:04:08,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {16746#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16747#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 5) main_~n~0) (<= 5 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:08,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {16747#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 5) main_~n~0) (<= 5 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {16748#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} is VALID
[2022-04-08 10:04:08,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {16748#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} ~z~0 := ~y~0; {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID
[2022-04-08 10:04:08,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID
[2022-04-08 10:04:08,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID
[2022-04-08 10:04:08,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:04:08,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:04:08,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:04:08,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:04:08,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:04:08,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:04:08,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID
[2022-04-08 10:04:08,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID
[2022-04-08 10:04:08,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:08,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:08,099 INFO L272 TraceCheckUtils]: 25: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:04:08,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {16756#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16757#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:04:08,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {16757#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16738#false} is VALID
[2022-04-08 10:04:08,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} assume !false; {16738#false} is VALID
[2022-04-08 10:04:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:04:08,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:04:08,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132639727]
[2022-04-08 10:04:08,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132639727] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:04:08,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788316945]
[2022-04-08 10:04:08,101 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:04:08,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:08,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:04:08,102 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:04:08,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process
[2022-04-08 10:04:08,209 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2022-04-08 10:04:08,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:04:08,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core
[2022-04-08 10:04:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:08,219 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:04:28,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} call ULTIMATE.init(); {16737#true} is VALID
[2022-04-08 10:04:28,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID
[2022-04-08 10:04:28,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} assume true; {16737#true} is VALID
[2022-04-08 10:04:28,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} #61#return; {16737#true} is VALID
[2022-04-08 10:04:28,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} call #t~ret11 := main(); {16737#true} is VALID
[2022-04-08 10:04:28,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16742#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:04:28,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {16742#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16780#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID
[2022-04-08 10:04:28,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {16780#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16784#(and (= (+ (- 1) main_~y~0) 1) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID
[2022-04-08 10:04:28,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {16784#(and (= (+ (- 1) main_~y~0) 1) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16788#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)))} is VALID
[2022-04-08 10:04:28,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {16788#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16792#(and (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (= (+ main_~y~0 (- 3)) 1))} is VALID
[2022-04-08 10:04:28,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {16792#(and (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (= (+ main_~y~0 (- 3)) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16796#(and (= 5 main_~y~0) (= (+ main_~x~0 4) (+ (- 1) main_~n~0)))} is VALID
[2022-04-08 10:04:28,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {16796#(and (= 5 main_~y~0) (= (+ main_~x~0 4) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {16748#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} is VALID
[2022-04-08 10:04:28,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {16748#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} ~z~0 := ~y~0; {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID
[2022-04-08 10:04:28,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID
[2022-04-08 10:04:28,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID
[2022-04-08 10:04:28,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:04:28,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:04:28,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:04:28,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:04:28,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:04:28,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:04:28,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID
[2022-04-08 10:04:28,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID
[2022-04-08 10:04:28,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID
[2022-04-08 10:04:28,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} assume !(~y~0 % 4294967296 > 0); {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID
[2022-04-08 10:04:28,211 INFO L272 TraceCheckUtils]: 25: Hoare triple {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:04:28,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {16842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16846#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:04:28,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {16846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16738#false} is VALID
[2022-04-08 10:04:28,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} assume !false; {16738#false} is VALID
[2022-04-08 10:04:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:04:28,212 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:04:32,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} assume !false; {16738#false} is VALID
[2022-04-08 10:04:32,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {16846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16738#false} is VALID
[2022-04-08 10:04:32,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {16842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16846#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:04:32,083 INFO L272 TraceCheckUtils]: 25: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:04:32,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:32,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {16868#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:32,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {16872#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16868#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:32,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {16876#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16872#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:04:32,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {16880#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16876#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:32,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {16884#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16880#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:04:32,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {16884#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {16884#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:32,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {16880#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16884#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:32,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {16876#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16880#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:04:32,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {16872#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16876#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:32,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {16868#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16872#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:04:32,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16868#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:32,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {16906#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:04:32,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {16910#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {16906#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:04:32,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {16914#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16910#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:04:32,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {16918#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16914#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:04:32,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {16922#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16918#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:04:32,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {16926#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16922#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:04:32,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {16930#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16926#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:04:32,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16930#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:04:32,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} call #t~ret11 := main(); {16737#true} is VALID
[2022-04-08 10:04:32,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} #61#return; {16737#true} is VALID
[2022-04-08 10:04:32,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} assume true; {16737#true} is VALID
[2022-04-08 10:04:32,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID
[2022-04-08 10:04:32,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} call ULTIMATE.init(); {16737#true} is VALID
[2022-04-08 10:04:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:04:32,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788316945] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:04:32,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:04:32,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 38
[2022-04-08 10:04:32,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:04:32,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1370802565]
[2022-04-08 10:04:32,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1370802565] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:04:32,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:04:32,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2022-04-08 10:04:32,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124883912]
[2022-04-08 10:04:32,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:04:32,104 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 10:04:32,104 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:04:32,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:32,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:32,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-08 10:04:32,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-08 10:04:32,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406
[2022-04-08 10:04:32,263 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:34,080 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions.
[2022-04-08 10:04:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2022-04-08 10:04:34,081 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 10:04:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:04:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions.
[2022-04-08 10:04:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions.
[2022-04-08 10:04:34,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 49 transitions.
[2022-04-08 10:04:34,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:34,164 INFO L225 Difference]: With dead ends: 102
[2022-04-08 10:04:34,164 INFO L226 Difference]: Without dead ends: 74
[2022-04-08 10:04:34,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=323, Invalid=2983, Unknown=0, NotChecked=0, Total=3306
[2022-04-08 10:04:34,165 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:04:34,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:04:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2022-04-08 10:04:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74.
[2022-04-08 10:04:34,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:04:34,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:34,230 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:34,231 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:34,231 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions.
[2022-04-08 10:04:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions.
[2022-04-08 10:04:34,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:34,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:34,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states.
[2022-04-08 10:04:34,232 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states.
[2022-04-08 10:04:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:34,232 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions.
[2022-04-08 10:04:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions.
[2022-04-08 10:04:34,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:34,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:34,233 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:04:34,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:04:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions.
[2022-04-08 10:04:34,234 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 29
[2022-04-08 10:04:34,234 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:04:34,234 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions.
[2022-04-08 10:04:34,234 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:34,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 94 transitions.
[2022-04-08 10:04:37,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions.
[2022-04-08 10:04:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 10:04:37,028 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:04:37,029 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:04:37,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0
[2022-04-08 10:04:37,241 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:37,241 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:04:37,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:04:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1573757487, now seen corresponding path program 37 times
[2022-04-08 10:04:37,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:37,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1126409529]
[2022-04-08 10:04:37,243 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:04:37,243 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:04:37,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1573757487, now seen corresponding path program 38 times
[2022-04-08 10:04:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:04:37,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816064157]
[2022-04-08 10:04:37,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:04:37,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:04:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:04:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:37,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {17507#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17491#true} is VALID
[2022-04-08 10:04:37,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {17491#true} assume true; {17491#true} is VALID
[2022-04-08 10:04:37,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17491#true} {17491#true} #61#return; {17491#true} is VALID
[2022-04-08 10:04:37,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {17491#true} call ULTIMATE.init(); {17507#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:04:37,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {17507#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17491#true} is VALID
[2022-04-08 10:04:37,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {17491#true} assume true; {17491#true} is VALID
[2022-04-08 10:04:37,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17491#true} {17491#true} #61#return; {17491#true} is VALID
[2022-04-08 10:04:37,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {17491#true} call #t~ret11 := main(); {17491#true} is VALID
[2022-04-08 10:04:37,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {17491#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17496#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:37,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {17496#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17497#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:37,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {17497#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17498#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:37,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {17498#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17499#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:37,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {17499#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17500#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:37,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {17500#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17501#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:37,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {17501#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:37,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:37,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {17503#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:04:37,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {17503#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17504#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:04:37,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {17504#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17505#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:04:37,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {17505#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17506#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {17506#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {17492#false} assume !(~y~0 % 4294967296 > 0); {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L272 TraceCheckUtils]: 25: Hoare triple {17492#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {17492#false} ~cond := #in~cond; {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {17492#false} assume 0 == ~cond; {17492#false} is VALID
[2022-04-08 10:04:37,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {17492#false} assume !false; {17492#false} is VALID
[2022-04-08 10:04:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:04:37,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:04:37,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816064157]
[2022-04-08 10:04:37,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816064157] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:04:37,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118605126]
[2022-04-08 10:04:37,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:04:37,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:37,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:04:37,426 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:04:37,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process
[2022-04-08 10:04:37,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:04:37,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:04:37,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 30 conjunts are in the unsatisfiable core
[2022-04-08 10:04:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:37,472 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:04:37,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {17491#true} call ULTIMATE.init(); {17491#true} is VALID
[2022-04-08 10:04:37,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {17491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17491#true} is VALID
[2022-04-08 10:04:37,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {17491#true} assume true; {17491#true} is VALID
[2022-04-08 10:04:37,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17491#true} {17491#true} #61#return; {17491#true} is VALID
[2022-04-08 10:04:37,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {17491#true} call #t~ret11 := main(); {17491#true} is VALID
[2022-04-08 10:04:37,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {17491#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17496#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:37,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {17496#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17497#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:37,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {17497#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17498#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:37,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {17498#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17499#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:37,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {17499#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17500#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:37,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {17500#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17501#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:37,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {17501#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:37,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:37,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {17550#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:37,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {17550#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17554#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:04:37,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {17554#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17558#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:37,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {17558#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17562#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {17562#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {17492#false} assume !(~y~0 % 4294967296 > 0); {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L272 TraceCheckUtils]: 25: Hoare triple {17492#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {17492#false} ~cond := #in~cond; {17492#false} is VALID
[2022-04-08 10:04:37,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {17492#false} assume 0 == ~cond; {17492#false} is VALID
[2022-04-08 10:04:37,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {17492#false} assume !false; {17492#false} is VALID
[2022-04-08 10:04:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:04:37,661 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:04:37,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {17492#false} assume !false; {17492#false} is VALID
[2022-04-08 10:04:37,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {17492#false} assume 0 == ~cond; {17492#false} is VALID
[2022-04-08 10:04:37,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {17492#false} ~cond := #in~cond; {17492#false} is VALID
[2022-04-08 10:04:37,912 INFO L272 TraceCheckUtils]: 25: Hoare triple {17492#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17492#false} is VALID
[2022-04-08 10:04:37,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {17492#false} assume !(~y~0 % 4294967296 > 0); {17492#false} is VALID
[2022-04-08 10:04:37,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {17620#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID
[2022-04-08 10:04:37,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {17624#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17620#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:04:37,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {17628#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17624#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:04:37,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {17632#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17628#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:04:37,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {17636#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {17632#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:04:37,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {17640#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17636#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID
[2022-04-08 10:04:37,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {17644#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17640#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:04:37,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {17648#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17644#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID
[2022-04-08 10:04:37,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {17491#true} ~z~0 := ~y~0; {17648#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:04:37,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {17491#true} assume !(~x~0 % 4294967296 > 0); {17491#true} is VALID
[2022-04-08 10:04:37,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {17491#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17491#true} is VALID
[2022-04-08 10:04:37,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {17491#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17491#true} is VALID
[2022-04-08 10:04:37,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {17491#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {17491#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {17491#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {17491#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {17491#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {17491#true} call #t~ret11 := main(); {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17491#true} {17491#true} #61#return; {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {17491#true} assume true; {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {17491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {17491#true} call ULTIMATE.init(); {17491#true} is VALID
[2022-04-08 10:04:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-08 10:04:37,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118605126] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:04:37,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:04:37,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 26
[2022-04-08 10:04:37,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:04:37,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1126409529]
[2022-04-08 10:04:37,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1126409529] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:04:37,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:04:37,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-04-08 10:04:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185065280]
[2022-04-08 10:04:37,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:04:37,921 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 10:04:37,921 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:04:37,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:37,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:37,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-04-08 10:04:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:37,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-04-08 10:04:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650
[2022-04-08 10:04:37,941 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:38,558 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions.
[2022-04-08 10:04:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-04-08 10:04:38,558 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 10:04:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:04:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions.
[2022-04-08 10:04:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions.
[2022-04-08 10:04:38,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 47 transitions.
[2022-04-08 10:04:38,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:38,598 INFO L225 Difference]: With dead ends: 95
[2022-04-08 10:04:38,598 INFO L226 Difference]: Without dead ends: 83
[2022-04-08 10:04:38,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332
[2022-04-08 10:04:38,599 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:04:38,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:04:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2022-04-08 10:04:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75.
[2022-04-08 10:04:38,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:04:38,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:38,689 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:38,689 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:38,690 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions.
[2022-04-08 10:04:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions.
[2022-04-08 10:04:38,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:38,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:38,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states.
[2022-04-08 10:04:38,690 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states.
[2022-04-08 10:04:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:38,691 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions.
[2022-04-08 10:04:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions.
[2022-04-08 10:04:38,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:38,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:38,691 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:04:38,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:04:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions.
[2022-04-08 10:04:38,692 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 29
[2022-04-08 10:04:38,692 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:04:38,692 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions.
[2022-04-08 10:04:38,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:38,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 95 transitions.
[2022-04-08 10:04:40,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions.
[2022-04-08 10:04:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 10:04:40,730 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:04:40,730 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:04:40,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0
[2022-04-08 10:04:40,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33
[2022-04-08 10:04:40,930 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:04:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:04:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash 335464319, now seen corresponding path program 39 times
[2022-04-08 10:04:40,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:40,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [491465874]
[2022-04-08 10:04:40,933 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:04:40,933 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:04:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash 335464319, now seen corresponding path program 40 times
[2022-04-08 10:04:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:04:40,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888003977]
[2022-04-08 10:04:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:04:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:04:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:04:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:41,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {18236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18221#true} is VALID
[2022-04-08 10:04:41,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {18221#true} assume true; {18221#true} is VALID
[2022-04-08 10:04:41,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18221#true} {18221#true} #61#return; {18221#true} is VALID
[2022-04-08 10:04:41,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {18221#true} call ULTIMATE.init(); {18236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:04:41,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {18236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18221#true} is VALID
[2022-04-08 10:04:41,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {18221#true} assume true; {18221#true} is VALID
[2022-04-08 10:04:41,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18221#true} {18221#true} #61#return; {18221#true} is VALID
[2022-04-08 10:04:41,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {18221#true} call #t~ret11 := main(); {18221#true} is VALID
[2022-04-08 10:04:41,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {18221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18226#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:41,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {18226#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18227#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:41,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {18227#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18228#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:41,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {18228#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18229#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:41,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {18229#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18230#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:41,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {18230#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18231#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:41,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {18231#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18232#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:41,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {18232#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:41,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:41,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {18234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:04:41,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {18234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18235#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:04:41,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {18235#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18222#false} is VALID
[2022-04-08 10:04:41,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {18222#false} assume !(~y~0 % 4294967296 > 0); {18222#false} is VALID
[2022-04-08 10:04:41,093 INFO L272 TraceCheckUtils]: 25: Hoare triple {18222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18222#false} is VALID
[2022-04-08 10:04:41,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {18222#false} ~cond := #in~cond; {18222#false} is VALID
[2022-04-08 10:04:41,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {18222#false} assume 0 == ~cond; {18222#false} is VALID
[2022-04-08 10:04:41,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {18222#false} assume !false; {18222#false} is VALID
[2022-04-08 10:04:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:04:41,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:04:41,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888003977]
[2022-04-08 10:04:41,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888003977] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:04:41,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177822104]
[2022-04-08 10:04:41,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:04:41,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:41,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:04:41,094 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:04:41,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process
[2022-04-08 10:04:41,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:04:41,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:04:41,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core
[2022-04-08 10:04:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:41,141 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:04:41,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {18221#true} call ULTIMATE.init(); {18221#true} is VALID
[2022-04-08 10:04:41,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {18221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18221#true} is VALID
[2022-04-08 10:04:41,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {18221#true} assume true; {18221#true} is VALID
[2022-04-08 10:04:41,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18221#true} {18221#true} #61#return; {18221#true} is VALID
[2022-04-08 10:04:41,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {18221#true} call #t~ret11 := main(); {18221#true} is VALID
[2022-04-08 10:04:41,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {18221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18226#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:41,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {18226#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18227#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:41,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {18227#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18228#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:41,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {18228#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18229#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:41,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {18229#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18230#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:41,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {18230#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18231#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:41,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {18231#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18232#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:41,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {18232#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:41,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:41,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {18234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:04:41,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {18234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18285#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:04:41,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {18285#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {18222#false} assume !(~y~0 % 4294967296 > 0); {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L272 TraceCheckUtils]: 25: Hoare triple {18222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {18222#false} ~cond := #in~cond; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {18222#false} assume 0 == ~cond; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {18222#false} assume !false; {18222#false} is VALID
[2022-04-08 10:04:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:04:41,342 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:04:41,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {18222#false} assume !false; {18222#false} is VALID
[2022-04-08 10:04:41,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {18222#false} assume 0 == ~cond; {18222#false} is VALID
[2022-04-08 10:04:41,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {18222#false} ~cond := #in~cond; {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L272 TraceCheckUtils]: 25: Hoare triple {18222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {18222#false} assume !(~y~0 % 4294967296 > 0); {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID
[2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {18361#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18222#false} is VALID
[2022-04-08 10:04:41,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {18365#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18361#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:04:41,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {18369#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {18365#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:04:41,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {18369#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18369#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:04:41,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {18376#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18369#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:04:41,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {18380#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18376#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:04:41,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {18384#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18380#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:04:41,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {18388#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18384#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:04:41,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {18392#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18388#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:04:41,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {18396#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18392#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:04:41,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {18400#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18396#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:04:41,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {18221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18400#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:04:41,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {18221#true} call #t~ret11 := main(); {18221#true} is VALID
[2022-04-08 10:04:41,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18221#true} {18221#true} #61#return; {18221#true} is VALID
[2022-04-08 10:04:41,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {18221#true} assume true; {18221#true} is VALID
[2022-04-08 10:04:41,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {18221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18221#true} is VALID
[2022-04-08 10:04:41,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {18221#true} call ULTIMATE.init(); {18221#true} is VALID
[2022-04-08 10:04:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:04:41,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177822104] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:04:41,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:04:41,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24
[2022-04-08 10:04:41,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:04:41,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [491465874]
[2022-04-08 10:04:41,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [491465874] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:04:41,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:04:41,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-04-08 10:04:41,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646291242]
[2022-04-08 10:04:41,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:04:41,582 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 10:04:41,582 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:04:41,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:41,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:41,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-04-08 10:04:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-04-08 10:04:41,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552
[2022-04-08 10:04:41,597 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:42,297 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions.
[2022-04-08 10:04:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-04-08 10:04:42,297 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 10:04:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:04:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions.
[2022-04-08 10:04:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions.
[2022-04-08 10:04:42,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 52 transitions.
[2022-04-08 10:04:42,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:42,340 INFO L225 Difference]: With dead ends: 98
[2022-04-08 10:04:42,340 INFO L226 Difference]: Without dead ends: 85
[2022-04-08 10:04:42,341 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190
[2022-04-08 10:04:42,341 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:04:42,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:04:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2022-04-08 10:04:42,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76.
[2022-04-08 10:04:42,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:04:42,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:42,412 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:42,412 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:42,412 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions.
[2022-04-08 10:04:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions.
[2022-04-08 10:04:42,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:42,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:42,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states.
[2022-04-08 10:04:42,413 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states.
[2022-04-08 10:04:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:42,414 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions.
[2022-04-08 10:04:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions.
[2022-04-08 10:04:42,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:42,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:42,414 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:04:42,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:04:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions.
[2022-04-08 10:04:42,415 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 29
[2022-04-08 10:04:42,415 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:04:42,415 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions.
[2022-04-08 10:04:42,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:42,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 96 transitions.
[2022-04-08 10:04:44,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions.
[2022-04-08 10:04:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 10:04:44,328 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:04:44,328 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:04:44,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0
[2022-04-08 10:04:44,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34
[2022-04-08 10:04:44,529 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:04:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:04:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2002837454, now seen corresponding path program 29 times
[2022-04-08 10:04:44,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:44,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [512724317]
[2022-04-08 10:04:44,531 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:04:44,531 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:04:44,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2002837454, now seen corresponding path program 30 times
[2022-04-08 10:04:44,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:04:44,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087448407]
[2022-04-08 10:04:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:04:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:04:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:44,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:04:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:44,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {18983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18961#true} is VALID
[2022-04-08 10:04:44,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {18961#true} assume true; {18961#true} is VALID
[2022-04-08 10:04:44,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18961#true} {18961#true} #61#return; {18961#true} is VALID
[2022-04-08 10:04:44,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {18961#true} call ULTIMATE.init(); {18983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:04:44,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {18983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18961#true} is VALID
[2022-04-08 10:04:44,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {18961#true} assume true; {18961#true} is VALID
[2022-04-08 10:04:44,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18961#true} {18961#true} #61#return; {18961#true} is VALID
[2022-04-08 10:04:44,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {18961#true} call #t~ret11 := main(); {18961#true} is VALID
[2022-04-08 10:04:44,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {18961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18966#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:44,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {18966#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18967#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:44,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {18967#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18968#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:44,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {18968#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18969#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:44,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {18969#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18970#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:44,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {18970#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18971#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:44,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {18971#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18972#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:44,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {18972#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18973#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:44,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {18973#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18974#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:04:44,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {18974#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18975#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:04:44,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {18975#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18976#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:04:44,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {18976#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18977#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:04:44,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {18977#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18978#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:04:44,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {18978#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18979#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:04:44,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {18979#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18980#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:04:44,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {18980#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:04:44,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:04:44,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {18982#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID
[2022-04-08 10:04:44,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {18982#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18962#false} is VALID
[2022-04-08 10:04:44,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {18962#false} assume !(~y~0 % 4294967296 > 0); {18962#false} is VALID
[2022-04-08 10:04:44,830 INFO L272 TraceCheckUtils]: 25: Hoare triple {18962#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18962#false} is VALID
[2022-04-08 10:04:44,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {18962#false} ~cond := #in~cond; {18962#false} is VALID
[2022-04-08 10:04:44,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {18962#false} assume 0 == ~cond; {18962#false} is VALID
[2022-04-08 10:04:44,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {18962#false} assume !false; {18962#false} is VALID
[2022-04-08 10:04:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:04:44,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:04:44,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087448407]
[2022-04-08 10:04:44,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087448407] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:04:44,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347008142]
[2022-04-08 10:04:44,831 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:04:44,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:44,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:04:44,832 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:04:44,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process
[2022-04-08 10:04:45,021 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s)
[2022-04-08 10:04:45,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:04:45,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 35 conjunts are in the unsatisfiable core
[2022-04-08 10:04:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:45,030 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:04:45,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {18961#true} call ULTIMATE.init(); {18961#true} is VALID
[2022-04-08 10:04:45,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {18961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18961#true} is VALID
[2022-04-08 10:04:45,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {18961#true} assume true; {18961#true} is VALID
[2022-04-08 10:04:45,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18961#true} {18961#true} #61#return; {18961#true} is VALID
[2022-04-08 10:04:45,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {18961#true} call #t~ret11 := main(); {18961#true} is VALID
[2022-04-08 10:04:45,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {18961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18966#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:45,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {18966#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18967#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:45,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {18967#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18968#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:45,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {18968#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18969#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:45,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {18969#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18970#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:45,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {18970#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18971#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:45,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {18971#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18972#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:45,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {18972#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18973#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:45,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {18973#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18974#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:04:45,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {18974#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18975#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:04:45,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {18975#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18976#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:04:45,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {18976#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18977#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:04:45,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {18977#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18978#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:04:45,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {18978#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18979#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:04:45,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {18979#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18980#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:04:45,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {18980#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:04:45,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:04:45,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {19053#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID
[2022-04-08 10:04:45,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {19053#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18962#false} is VALID
[2022-04-08 10:04:45,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {18962#false} assume !(~y~0 % 4294967296 > 0); {18962#false} is VALID
[2022-04-08 10:04:45,291 INFO L272 TraceCheckUtils]: 25: Hoare triple {18962#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18962#false} is VALID
[2022-04-08 10:04:45,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {18962#false} ~cond := #in~cond; {18962#false} is VALID
[2022-04-08 10:04:45,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {18962#false} assume 0 == ~cond; {18962#false} is VALID
[2022-04-08 10:04:45,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {18962#false} assume !false; {18962#false} is VALID
[2022-04-08 10:04:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:04:45,292 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:04:45,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {18962#false} assume !false; {18962#false} is VALID
[2022-04-08 10:04:45,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {18962#false} assume 0 == ~cond; {18962#false} is VALID
[2022-04-08 10:04:45,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {18962#false} ~cond := #in~cond; {18962#false} is VALID
[2022-04-08 10:04:45,802 INFO L272 TraceCheckUtils]: 25: Hoare triple {18962#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18962#false} is VALID
[2022-04-08 10:04:45,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {18962#false} assume !(~y~0 % 4294967296 > 0); {18962#false} is VALID
[2022-04-08 10:04:45,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {19087#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18962#false} is VALID
[2022-04-08 10:04:45,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {19091#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {19087#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:04:45,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {19091#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {19091#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:04:45,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {19098#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19091#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:04:45,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {19102#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19098#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:04:45,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {19106#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19102#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:04:45,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {19110#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19106#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:04:45,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {19114#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19110#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:04:45,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {19118#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19114#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:04:45,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {19122#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19118#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:04:45,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {19126#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19122#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:04:45,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {19130#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19126#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:04:45,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {19134#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19130#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:04:45,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {19138#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19134#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:04:45,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {19142#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19138#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:04:45,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {19146#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19142#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:04:45,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {19150#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19146#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:04:45,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {19154#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19150#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:04:45,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {18961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19154#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:04:45,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {18961#true} call #t~ret11 := main(); {18961#true} is VALID
[2022-04-08 10:04:45,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18961#true} {18961#true} #61#return; {18961#true} is VALID
[2022-04-08 10:04:45,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {18961#true} assume true; {18961#true} is VALID
[2022-04-08 10:04:45,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {18961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18961#true} is VALID
[2022-04-08 10:04:45,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {18961#true} call ULTIMATE.init(); {18961#true} is VALID
[2022-04-08 10:04:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:04:45,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347008142] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:04:45,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:04:45,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38
[2022-04-08 10:04:45,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:04:45,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [512724317]
[2022-04-08 10:04:45,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [512724317] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:04:45,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:04:45,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-04-08 10:04:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697380171]
[2022-04-08 10:04:45,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:04:45,815 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 10:04:45,815 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:04:45,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:45,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:45,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-04-08 10:04:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:45,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-04-08 10:04:45,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406
[2022-04-08 10:04:45,834 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:47,981 INFO L93 Difference]: Finished difference Result 103 states and 142 transitions.
[2022-04-08 10:04:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-04-08 10:04:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29
[2022-04-08 10:04:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:04:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 114 transitions.
[2022-04-08 10:04:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 114 transitions.
[2022-04-08 10:04:47,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 114 transitions.
[2022-04-08 10:04:48,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:48,081 INFO L225 Difference]: With dead ends: 103
[2022-04-08 10:04:48,081 INFO L226 Difference]: Without dead ends: 97
[2022-04-08 10:04:48,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=673, Invalid=2297, Unknown=0, NotChecked=0, Total=2970
[2022-04-08 10:04:48,082 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-04-08 10:04:48,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 126 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-04-08 10:04:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2022-04-08 10:04:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81.
[2022-04-08 10:04:48,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:04:48,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:48,156 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:48,156 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:48,157 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions.
[2022-04-08 10:04:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions.
[2022-04-08 10:04:48,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:48,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:48,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states.
[2022-04-08 10:04:48,157 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states.
[2022-04-08 10:04:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:48,158 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions.
[2022-04-08 10:04:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions.
[2022-04-08 10:04:48,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:48,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:48,158 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:04:48,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:04:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions.
[2022-04-08 10:04:48,159 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 29
[2022-04-08 10:04:48,159 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:04:48,159 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions.
[2022-04-08 10:04:48,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:48,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 103 transitions.
[2022-04-08 10:04:51,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 102 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions.
[2022-04-08 10:04:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 10:04:51,981 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:04:51,981 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:04:51,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0
[2022-04-08 10:04:52,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35
[2022-04-08 10:04:52,182 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:04:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:04:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash -688544435, now seen corresponding path program 41 times
[2022-04-08 10:04:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:52,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609935523]
[2022-04-08 10:04:52,184 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:04:52,184 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:04:52,184 INFO L85 PathProgramCache]: Analyzing trace with hash -688544435, now seen corresponding path program 42 times
[2022-04-08 10:04:52,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:04:52,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638242834]
[2022-04-08 10:04:52,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:04:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:04:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:04:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:52,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {19788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19771#true} is VALID
[2022-04-08 10:04:52,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {19771#true} assume true; {19771#true} is VALID
[2022-04-08 10:04:52,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19771#true} {19771#true} #61#return; {19771#true} is VALID
[2022-04-08 10:04:52,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {19771#true} call ULTIMATE.init(); {19788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:04:52,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {19788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19771#true} is VALID
[2022-04-08 10:04:52,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {19771#true} assume true; {19771#true} is VALID
[2022-04-08 10:04:52,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19771#true} {19771#true} #61#return; {19771#true} is VALID
[2022-04-08 10:04:52,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {19771#true} call #t~ret11 := main(); {19771#true} is VALID
[2022-04-08 10:04:52,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {19771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19776#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:52,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {19776#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:52,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {19777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:52,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {19778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:52,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {19779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19780#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:52,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {19780#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19781#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:52,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {19781#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:52,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:52,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {19783#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:04:52,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {19783#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19784#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:04:52,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {19784#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19785#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:04:52,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {19785#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19786#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:04:52,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {19786#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19787#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:04:52,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {19787#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19772#false} is VALID
[2022-04-08 10:04:52,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {19772#false} assume !(~y~0 % 4294967296 > 0); {19772#false} is VALID
[2022-04-08 10:04:52,380 INFO L272 TraceCheckUtils]: 26: Hoare triple {19772#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19772#false} is VALID
[2022-04-08 10:04:52,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {19772#false} ~cond := #in~cond; {19772#false} is VALID
[2022-04-08 10:04:52,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {19772#false} assume 0 == ~cond; {19772#false} is VALID
[2022-04-08 10:04:52,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {19772#false} assume !false; {19772#false} is VALID
[2022-04-08 10:04:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:04:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:04:52,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638242834]
[2022-04-08 10:04:52,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638242834] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:04:52,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133625661]
[2022-04-08 10:04:52,381 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:04:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:04:52,382 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:04:52,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process
[2022-04-08 10:04:52,439 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2022-04-08 10:04:52,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:04:52,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core
[2022-04-08 10:04:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:52,447 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:04:52,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {19771#true} call ULTIMATE.init(); {19771#true} is VALID
[2022-04-08 10:04:52,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {19771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19771#true} is VALID
[2022-04-08 10:04:52,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {19771#true} assume true; {19771#true} is VALID
[2022-04-08 10:04:52,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19771#true} {19771#true} #61#return; {19771#true} is VALID
[2022-04-08 10:04:52,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {19771#true} call #t~ret11 := main(); {19771#true} is VALID
[2022-04-08 10:04:52,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {19771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19776#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:52,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {19776#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:52,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {19777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:52,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {19778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:52,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {19779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19780#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:52,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {19780#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19781#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:52,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {19781#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:52,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:52,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {19831#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:52,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {19831#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19835#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:04:52,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {19835#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19839#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:52,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {19839#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19843#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:52,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {19843#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19847#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {19847#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {19772#false} assume !(~y~0 % 4294967296 > 0); {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L272 TraceCheckUtils]: 26: Hoare triple {19772#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {19772#false} ~cond := #in~cond; {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {19772#false} assume 0 == ~cond; {19772#false} is VALID
[2022-04-08 10:04:52,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {19772#false} assume !false; {19772#false} is VALID
[2022-04-08 10:04:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:04:52,661 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:04:52,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {19772#false} assume !false; {19772#false} is VALID
[2022-04-08 10:04:52,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {19772#false} assume 0 == ~cond; {19772#false} is VALID
[2022-04-08 10:04:52,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {19772#false} ~cond := #in~cond; {19772#false} is VALID
[2022-04-08 10:04:52,944 INFO L272 TraceCheckUtils]: 26: Hoare triple {19772#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19772#false} is VALID
[2022-04-08 10:04:52,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {19772#false} assume !(~y~0 % 4294967296 > 0); {19772#false} is VALID
[2022-04-08 10:04:52,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {19902#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID
[2022-04-08 10:04:52,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {19906#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19902#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:04:52,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {19910#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19906#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:04:52,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {19914#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19910#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:04:52,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {19918#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19914#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:04:52,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {19922#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19918#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:04:52,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {19926#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19922#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:04:52,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {19930#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19926#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:04:52,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {19934#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19930#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:04:52,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {19938#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19934#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {19771#true} ~z~0 := ~y~0; {19938#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {19771#true} assume !(~x~0 % 4294967296 > 0); {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {19771#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {19771#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {19771#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {19771#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {19771#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {19771#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {19771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {19771#true} call #t~ret11 := main(); {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19771#true} {19771#true} #61#return; {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {19771#true} assume true; {19771#true} is VALID
[2022-04-08 10:04:52,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {19771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19771#true} is VALID
[2022-04-08 10:04:52,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {19771#true} call ULTIMATE.init(); {19771#true} is VALID
[2022-04-08 10:04:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2022-04-08 10:04:52,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133625661] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:04:52,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:04:52,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 30
[2022-04-08 10:04:52,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:04:52,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609935523]
[2022-04-08 10:04:52,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609935523] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:04:52,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:04:52,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-04-08 10:04:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269354784]
[2022-04-08 10:04:52,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:04:52,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 10:04:52,956 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:04:52,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:52,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:52,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-04-08 10:04:52,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:52,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-04-08 10:04:52,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870
[2022-04-08 10:04:52,973 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:53,679 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions.
[2022-04-08 10:04:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-04-08 10:04:53,679 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 10:04:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:04:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions.
[2022-04-08 10:04:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions.
[2022-04-08 10:04:53,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 48 transitions.
[2022-04-08 10:04:53,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:53,723 INFO L225 Difference]: With dead ends: 102
[2022-04-08 10:04:53,723 INFO L226 Difference]: Without dead ends: 90
[2022-04-08 10:04:53,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722
[2022-04-08 10:04:53,724 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:04:53,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 10:04:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2022-04-08 10:04:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82.
[2022-04-08 10:04:53,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:04:53,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:53,803 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:53,803 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:53,807 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions.
[2022-04-08 10:04:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions.
[2022-04-08 10:04:53,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:53,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:53,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states.
[2022-04-08 10:04:53,807 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states.
[2022-04-08 10:04:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:53,808 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions.
[2022-04-08 10:04:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions.
[2022-04-08 10:04:53,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:53,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:53,808 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:04:53,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:04:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions.
[2022-04-08 10:04:53,809 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 30
[2022-04-08 10:04:53,809 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:04:53,809 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions.
[2022-04-08 10:04:53,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:53,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 104 transitions.
[2022-04-08 10:04:55,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions.
[2022-04-08 10:04:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 10:04:55,675 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:04:55,675 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:04:55,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0
[2022-04-08 10:04:55,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:55,887 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:04:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:04:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash 352108927, now seen corresponding path program 43 times
[2022-04-08 10:04:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:55,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152231585]
[2022-04-08 10:04:55,890 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:04:55,890 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:04:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash 352108927, now seen corresponding path program 44 times
[2022-04-08 10:04:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:04:55,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735595980]
[2022-04-08 10:04:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:04:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:04:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:56,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:04:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:56,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {20571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20555#true} is VALID
[2022-04-08 10:04:56,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {20555#true} assume true; {20555#true} is VALID
[2022-04-08 10:04:56,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20555#true} {20555#true} #61#return; {20555#true} is VALID
[2022-04-08 10:04:56,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {20555#true} call ULTIMATE.init(); {20571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:04:56,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {20571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20555#true} is VALID
[2022-04-08 10:04:56,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {20555#true} assume true; {20555#true} is VALID
[2022-04-08 10:04:56,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20555#true} {20555#true} #61#return; {20555#true} is VALID
[2022-04-08 10:04:56,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {20555#true} call #t~ret11 := main(); {20555#true} is VALID
[2022-04-08 10:04:56,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {20555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20560#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:56,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {20560#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20561#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:56,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {20561#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20562#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:56,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {20562#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20563#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:56,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {20563#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20564#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:56,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {20564#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20565#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:56,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {20565#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20566#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:56,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {20566#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:56,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:56,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {20568#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:04:56,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {20568#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20569#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:04:56,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {20569#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20570#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:04:56,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {20570#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20556#false} is VALID
[2022-04-08 10:04:56,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {20556#false} assume !(~y~0 % 4294967296 > 0); {20556#false} is VALID
[2022-04-08 10:04:56,060 INFO L272 TraceCheckUtils]: 26: Hoare triple {20556#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20556#false} is VALID
[2022-04-08 10:04:56,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {20556#false} ~cond := #in~cond; {20556#false} is VALID
[2022-04-08 10:04:56,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#false} assume 0 == ~cond; {20556#false} is VALID
[2022-04-08 10:04:56,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#false} assume !false; {20556#false} is VALID
[2022-04-08 10:04:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:04:56,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:04:56,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735595980]
[2022-04-08 10:04:56,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735595980] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:04:56,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236446801]
[2022-04-08 10:04:56,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:04:56,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:04:56,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:04:56,062 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:04:56,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process
[2022-04-08 10:04:56,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:04:56,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:04:56,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core
[2022-04-08 10:04:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:04:56,107 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:04:56,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {20555#true} call ULTIMATE.init(); {20555#true} is VALID
[2022-04-08 10:04:56,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {20555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20555#true} is VALID
[2022-04-08 10:04:56,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {20555#true} assume true; {20555#true} is VALID
[2022-04-08 10:04:56,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20555#true} {20555#true} #61#return; {20555#true} is VALID
[2022-04-08 10:04:56,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {20555#true} call #t~ret11 := main(); {20555#true} is VALID
[2022-04-08 10:04:56,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {20555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20560#(= main_~y~0 0)} is VALID
[2022-04-08 10:04:56,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {20560#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20561#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:04:56,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {20561#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20562#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:04:56,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {20562#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20563#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:04:56,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {20563#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20564#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:04:56,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {20564#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20565#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:04:56,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {20565#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20566#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:04:56,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {20566#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:56,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:04:56,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {20568#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:04:56,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {20568#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20569#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:04:56,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {20569#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20623#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:04:56,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {20623#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {20556#false} is VALID
[2022-04-08 10:04:56,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {20556#false} assume !(~y~0 % 4294967296 > 0); {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L272 TraceCheckUtils]: 26: Hoare triple {20556#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {20556#false} ~cond := #in~cond; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#false} assume 0 == ~cond; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#false} assume !false; {20556#false} is VALID
[2022-04-08 10:04:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:04:56,336 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:04:56,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#false} assume !false; {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#false} assume 0 == ~cond; {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {20556#false} ~cond := #in~cond; {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L272 TraceCheckUtils]: 26: Hoare triple {20556#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {20556#false} assume !(~y~0 % 4294967296 > 0); {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID
[2022-04-08 10:04:56,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {20699#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20556#false} is VALID
[2022-04-08 10:04:56,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {20703#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20699#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:04:56,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {20707#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20703#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:04:56,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {20711#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {20707#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:04:56,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {20711#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20711#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:04:56,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {20718#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20711#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:04:56,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {20722#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20718#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:04:56,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {20726#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20722#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:04:56,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {20730#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20726#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:04:56,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {20734#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20730#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:04:56,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {20738#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20734#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:04:56,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {20742#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20738#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:04:56,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {20555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20742#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:04:56,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {20555#true} call #t~ret11 := main(); {20555#true} is VALID
[2022-04-08 10:04:56,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20555#true} {20555#true} #61#return; {20555#true} is VALID
[2022-04-08 10:04:56,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {20555#true} assume true; {20555#true} is VALID
[2022-04-08 10:04:56,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {20555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20555#true} is VALID
[2022-04-08 10:04:56,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {20555#true} call ULTIMATE.init(); {20555#true} is VALID
[2022-04-08 10:04:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:04:56,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236446801] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:04:56,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:04:56,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26
[2022-04-08 10:04:56,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:04:56,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152231585]
[2022-04-08 10:04:56,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152231585] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:04:56,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:04:56,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-04-08 10:04:56,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560950145]
[2022-04-08 10:04:56,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:04:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 10:04:56,599 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:04:56,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:56,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:56,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-04-08 10:04:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:04:56,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-04-08 10:04:56,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650
[2022-04-08 10:04:56,614 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:57,403 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions.
[2022-04-08 10:04:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-04-08 10:04:57,403 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 10:04:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:04:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions.
[2022-04-08 10:04:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions.
[2022-04-08 10:04:57,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 54 transitions.
[2022-04-08 10:04:57,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:04:57,449 INFO L225 Difference]: With dead ends: 105
[2022-04-08 10:04:57,449 INFO L226 Difference]: Without dead ends: 92
[2022-04-08 10:04:57,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482
[2022-04-08 10:04:57,450 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:04:57,450 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:04:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2022-04-08 10:04:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83.
[2022-04-08 10:04:57,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:04:57,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:57,537 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:57,537 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:57,539 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions.
[2022-04-08 10:04:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions.
[2022-04-08 10:04:57,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:57,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:57,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states.
[2022-04-08 10:04:57,539 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states.
[2022-04-08 10:04:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:04:57,540 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions.
[2022-04-08 10:04:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions.
[2022-04-08 10:04:57,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:04:57,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:04:57,541 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:04:57,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:04:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions.
[2022-04-08 10:04:57,542 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 30
[2022-04-08 10:04:57,542 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:04:57,542 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions.
[2022-04-08 10:04:57,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:04:57,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 105 transitions.
[2022-04-08 10:05:00,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 104 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions.
[2022-04-08 10:05:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-08 10:05:00,247 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:05:00,247 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:05:00,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0
[2022-04-08 10:05:00,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37
[2022-04-08 10:05:00,448 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:05:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:05:00,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1483692467, now seen corresponding path program 31 times
[2022-04-08 10:05:00,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:00,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1979503553]
[2022-04-08 10:05:00,450 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:05:00,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:05:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1483692467, now seen corresponding path program 32 times
[2022-04-08 10:05:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:05:00,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198779958]
[2022-04-08 10:05:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:05:00,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:05:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:05:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:00,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {21372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21349#true} is VALID
[2022-04-08 10:05:00,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {21349#true} assume true; {21349#true} is VALID
[2022-04-08 10:05:00,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21349#true} {21349#true} #61#return; {21349#true} is VALID
[2022-04-08 10:05:00,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {21349#true} call ULTIMATE.init(); {21372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:05:00,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {21372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21349#true} is VALID
[2022-04-08 10:05:00,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {21349#true} assume true; {21349#true} is VALID
[2022-04-08 10:05:00,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21349#true} {21349#true} #61#return; {21349#true} is VALID
[2022-04-08 10:05:00,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {21349#true} call #t~ret11 := main(); {21349#true} is VALID
[2022-04-08 10:05:00,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {21349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21354#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:00,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {21354#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:00,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {21355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:00,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {21356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:00,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {21357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:00,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {21358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:00,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {21359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:00,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {21360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:00,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {21361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:05:00,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {21362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:05:00,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {21363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:05:00,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {21364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:05:00,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {21365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:05:00,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {21366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21367#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:05:00,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {21367#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:05:00,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {21368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21369#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:05:00,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {21369#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:05:00,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:05:00,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {21371#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:05:00,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {21371#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21350#false} is VALID
[2022-04-08 10:05:00,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {21350#false} assume !(~y~0 % 4294967296 > 0); {21350#false} is VALID
[2022-04-08 10:05:00,765 INFO L272 TraceCheckUtils]: 26: Hoare triple {21350#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21350#false} is VALID
[2022-04-08 10:05:00,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {21350#false} ~cond := #in~cond; {21350#false} is VALID
[2022-04-08 10:05:00,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {21350#false} assume 0 == ~cond; {21350#false} is VALID
[2022-04-08 10:05:00,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {21350#false} assume !false; {21350#false} is VALID
[2022-04-08 10:05:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:05:00,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:05:00,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198779958]
[2022-04-08 10:05:00,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198779958] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:05:00,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110466084]
[2022-04-08 10:05:00,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:05:00,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:05:00,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:05:00,766 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:05:00,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process
[2022-04-08 10:05:00,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:05:00,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:05:00,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 37 conjunts are in the unsatisfiable core
[2022-04-08 10:05:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:00,812 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:05:01,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {21349#true} call ULTIMATE.init(); {21349#true} is VALID
[2022-04-08 10:05:01,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {21349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21349#true} is VALID
[2022-04-08 10:05:01,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {21349#true} assume true; {21349#true} is VALID
[2022-04-08 10:05:01,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21349#true} {21349#true} #61#return; {21349#true} is VALID
[2022-04-08 10:05:01,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {21349#true} call #t~ret11 := main(); {21349#true} is VALID
[2022-04-08 10:05:01,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {21349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21354#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:01,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {21354#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:01,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {21355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:01,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {21356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:01,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {21357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:01,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {21358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:01,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {21359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:01,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {21360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:01,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {21361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:05:01,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {21362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:05:01,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {21363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:05:01,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {21364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:05:01,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {21365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:05:01,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {21366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21367#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:05:01,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {21367#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:05:01,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {21368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21369#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:05:01,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {21369#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:05:01,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:05:01,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {21445#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID
[2022-04-08 10:05:01,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {21445#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {21350#false} is VALID
[2022-04-08 10:05:01,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {21350#false} assume !(~y~0 % 4294967296 > 0); {21350#false} is VALID
[2022-04-08 10:05:01,084 INFO L272 TraceCheckUtils]: 26: Hoare triple {21350#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21350#false} is VALID
[2022-04-08 10:05:01,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {21350#false} ~cond := #in~cond; {21350#false} is VALID
[2022-04-08 10:05:01,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {21350#false} assume 0 == ~cond; {21350#false} is VALID
[2022-04-08 10:05:01,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {21350#false} assume !false; {21350#false} is VALID
[2022-04-08 10:05:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:05:01,084 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:05:01,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {21350#false} assume !false; {21350#false} is VALID
[2022-04-08 10:05:01,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {21350#false} assume 0 == ~cond; {21350#false} is VALID
[2022-04-08 10:05:01,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {21350#false} ~cond := #in~cond; {21350#false} is VALID
[2022-04-08 10:05:01,655 INFO L272 TraceCheckUtils]: 26: Hoare triple {21350#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21350#false} is VALID
[2022-04-08 10:05:01,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {21350#false} assume !(~y~0 % 4294967296 > 0); {21350#false} is VALID
[2022-04-08 10:05:01,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {21479#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21350#false} is VALID
[2022-04-08 10:05:01,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {21483#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {21479#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:05:01,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {21483#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21483#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:05:01,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {21490#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21483#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:05:01,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {21494#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21490#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:05:01,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {21498#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21494#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:05:01,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {21502#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21498#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:05:01,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {21506#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21502#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:05:01,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {21510#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21506#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:05:01,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {21514#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21510#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:05:01,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {21518#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21514#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:05:01,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {21522#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21518#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:05:01,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {21526#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21522#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:05:01,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {21530#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21526#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:05:01,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {21534#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21530#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:05:01,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {21538#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21534#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:05:01,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {21542#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21538#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:05:01,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {21546#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21542#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:05:01,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {21550#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21546#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:05:01,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {21349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21550#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:05:01,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {21349#true} call #t~ret11 := main(); {21349#true} is VALID
[2022-04-08 10:05:01,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21349#true} {21349#true} #61#return; {21349#true} is VALID
[2022-04-08 10:05:01,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {21349#true} assume true; {21349#true} is VALID
[2022-04-08 10:05:01,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {21349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21349#true} is VALID
[2022-04-08 10:05:01,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {21349#true} call ULTIMATE.init(); {21349#true} is VALID
[2022-04-08 10:05:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:05:01,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110466084] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:05:01,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:05:01,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40
[2022-04-08 10:05:01,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:05:01,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1979503553]
[2022-04-08 10:05:01,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1979503553] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:05:01,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:05:01,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2022-04-08 10:05:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037714367]
[2022-04-08 10:05:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:05:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 10:05:01,669 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:05:01,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:01,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:01,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2022-04-08 10:05:01,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:01,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2022-04-08 10:05:01,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560
[2022-04-08 10:05:01,689 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:04,180 INFO L93 Difference]: Finished difference Result 111 states and 153 transitions.
[2022-04-08 10:05:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2022-04-08 10:05:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30
[2022-04-08 10:05:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:05:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 121 transitions.
[2022-04-08 10:05:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 121 transitions.
[2022-04-08 10:05:04,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 121 transitions.
[2022-04-08 10:05:04,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:04,275 INFO L225 Difference]: With dead ends: 111
[2022-04-08 10:05:04,275 INFO L226 Difference]: Without dead ends: 105
[2022-04-08 10:05:04,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306
[2022-04-08 10:05:04,276 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 100 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:05:04,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 134 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-04-08 10:05:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2022-04-08 10:05:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88.
[2022-04-08 10:05:04,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:05:04,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:04,363 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:04,363 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:04,364 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions.
[2022-04-08 10:05:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions.
[2022-04-08 10:05:04,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:04,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:04,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states.
[2022-04-08 10:05:04,364 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states.
[2022-04-08 10:05:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:04,365 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions.
[2022-04-08 10:05:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions.
[2022-04-08 10:05:04,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:04,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:04,366 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:05:04,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:05:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions.
[2022-04-08 10:05:04,367 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 30
[2022-04-08 10:05:04,367 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:05:04,367 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions.
[2022-04-08 10:05:04,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:04,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 112 transitions.
[2022-04-08 10:05:05,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions.
[2022-04-08 10:05:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 10:05:05,473 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:05:05,473 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:05:05,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0
[2022-04-08 10:05:05,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38
[2022-04-08 10:05:05,673 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:05:05,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:05:05,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2100427281, now seen corresponding path program 45 times
[2022-04-08 10:05:05,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:05,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [626704834]
[2022-04-08 10:05:05,676 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:05:05,676 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:05:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2100427281, now seen corresponding path program 46 times
[2022-04-08 10:05:05,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:05:05,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589510981]
[2022-04-08 10:05:05,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:05:05,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:05:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:05:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:05,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {22233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22215#true} is VALID
[2022-04-08 10:05:05,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#true} assume true; {22215#true} is VALID
[2022-04-08 10:05:05,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22215#true} {22215#true} #61#return; {22215#true} is VALID
[2022-04-08 10:05:05,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:05:05,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {22233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22215#true} is VALID
[2022-04-08 10:05:05,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#true} assume true; {22215#true} is VALID
[2022-04-08 10:05:05,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22215#true} {22215#true} #61#return; {22215#true} is VALID
[2022-04-08 10:05:05,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {22215#true} call #t~ret11 := main(); {22215#true} is VALID
[2022-04-08 10:05:05,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {22215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22220#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:05,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {22220#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:05,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {22221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:05,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {22222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:05,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {22223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:05,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {22224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:05,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {22225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:05,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:05,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {22227#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:05:05,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {22227#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22228#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:05:05,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {22228#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22229#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:05:05,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {22229#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22230#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:05:05,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {22230#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22231#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:05:05,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {22231#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22232#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:05:05,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {22232#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {22216#false} is VALID
[2022-04-08 10:05:05,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:05,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:05,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:05,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:05,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:05,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:05,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {22216#false} assume !(~y~0 % 4294967296 > 0); {22216#false} is VALID
[2022-04-08 10:05:05,879 INFO L272 TraceCheckUtils]: 27: Hoare triple {22216#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22216#false} is VALID
[2022-04-08 10:05:05,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID
[2022-04-08 10:05:05,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID
[2022-04-08 10:05:05,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {22216#false} assume !false; {22216#false} is VALID
[2022-04-08 10:05:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:05:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:05:05,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589510981]
[2022-04-08 10:05:05,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589510981] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:05:05,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940811717]
[2022-04-08 10:05:05,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:05:05,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:05:05,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:05:05,880 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:05:05,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process
[2022-04-08 10:05:05,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:05:05,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:05:05,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core
[2022-04-08 10:05:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:05,930 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:05:06,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22215#true} is VALID
[2022-04-08 10:05:06,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22215#true} is VALID
[2022-04-08 10:05:06,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#true} assume true; {22215#true} is VALID
[2022-04-08 10:05:06,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22215#true} {22215#true} #61#return; {22215#true} is VALID
[2022-04-08 10:05:06,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {22215#true} call #t~ret11 := main(); {22215#true} is VALID
[2022-04-08 10:05:06,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {22215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22220#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:06,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {22220#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:06,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {22221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:06,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {22222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:06,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {22223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:06,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {22224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:06,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {22225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:06,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:06,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {22276#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:06,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {22276#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22280#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:05:06,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {22280#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22284#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:06,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {22284#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22288#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:06,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {22288#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22292#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:06,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {22292#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22296#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {22296#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {22216#false} assume !(~y~0 % 4294967296 > 0); {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L272 TraceCheckUtils]: 27: Hoare triple {22216#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID
[2022-04-08 10:05:06,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {22216#false} assume !false; {22216#false} is VALID
[2022-04-08 10:05:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:05:06,190 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:05:06,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {22216#false} assume !false; {22216#false} is VALID
[2022-04-08 10:05:06,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID
[2022-04-08 10:05:06,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID
[2022-04-08 10:05:06,576 INFO L272 TraceCheckUtils]: 27: Hoare triple {22216#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22216#false} is VALID
[2022-04-08 10:05:06,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {22216#false} assume !(~y~0 % 4294967296 > 0); {22216#false} is VALID
[2022-04-08 10:05:06,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {22348#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID
[2022-04-08 10:05:06,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {22352#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22348#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:05:06,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {22356#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22352#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:05:06,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {22360#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22356#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:05:06,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {22364#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22360#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:05:06,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {22368#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22364#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:05:06,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {22372#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22368#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:05:06,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {22376#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22372#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:05:06,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {22380#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22376#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:05:06,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {22384#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22380#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:05:06,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {22388#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22384#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:05:06,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {22392#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22388#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:05:06,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {22215#true} ~z~0 := ~y~0; {22392#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {22215#true} assume !(~x~0 % 4294967296 > 0); {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {22215#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {22215#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {22215#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {22215#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {22215#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {22215#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {22215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {22215#true} call #t~ret11 := main(); {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22215#true} {22215#true} #61#return; {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#true} assume true; {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22215#true} is VALID
[2022-04-08 10:05:06,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22215#true} is VALID
[2022-04-08 10:05:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2022-04-08 10:05:06,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940811717] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:05:06,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:05:06,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 34
[2022-04-08 10:05:06,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:05:06,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [626704834]
[2022-04-08 10:05:06,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [626704834] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:05:06,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:05:06,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-04-08 10:05:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560960202]
[2022-04-08 10:05:06,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:05:06,590 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 10:05:06,590 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:05:06,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:06,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:06,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-04-08 10:05:06,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-04-08 10:05:06,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122
[2022-04-08 10:05:06,608 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:07,432 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions.
[2022-04-08 10:05:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-04-08 10:05:07,432 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 10:05:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:05:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions.
[2022-04-08 10:05:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions.
[2022-04-08 10:05:07,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions.
[2022-04-08 10:05:07,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:07,472 INFO L225 Difference]: With dead ends: 109
[2022-04-08 10:05:07,472 INFO L226 Difference]: Without dead ends: 97
[2022-04-08 10:05:07,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1881, Unknown=0, NotChecked=0, Total=2162
[2022-04-08 10:05:07,473 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:05:07,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:05:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2022-04-08 10:05:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89.
[2022-04-08 10:05:07,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:05:07,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:07,569 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:07,569 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:07,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:07,570 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions.
[2022-04-08 10:05:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions.
[2022-04-08 10:05:07,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:07,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:07,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states.
[2022-04-08 10:05:07,570 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states.
[2022-04-08 10:05:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:07,579 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions.
[2022-04-08 10:05:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions.
[2022-04-08 10:05:07,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:07,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:07,579 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:05:07,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:05:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions.
[2022-04-08 10:05:07,580 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 31
[2022-04-08 10:05:07,580 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:05:07,580 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions.
[2022-04-08 10:05:07,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:07,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 113 transitions.
[2022-04-08 10:05:09,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions.
[2022-04-08 10:05:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 10:05:09,386 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:05:09,386 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:05:09,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0
[2022-04-08 10:05:09,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39
[2022-04-08 10:05:09,587 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:05:09,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:05:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash 868091775, now seen corresponding path program 47 times
[2022-04-08 10:05:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:09,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1580583037]
[2022-04-08 10:05:09,589 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:05:09,589 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:05:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash 868091775, now seen corresponding path program 48 times
[2022-04-08 10:05:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:05:09,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902714585]
[2022-04-08 10:05:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:05:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:05:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:05:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:09,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {23070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23053#true} is VALID
[2022-04-08 10:05:09,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#true} assume true; {23053#true} is VALID
[2022-04-08 10:05:09,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23053#true} {23053#true} #61#return; {23053#true} is VALID
[2022-04-08 10:05:09,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:05:09,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {23070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23053#true} is VALID
[2022-04-08 10:05:09,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {23053#true} assume true; {23053#true} is VALID
[2022-04-08 10:05:09,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23053#true} {23053#true} #61#return; {23053#true} is VALID
[2022-04-08 10:05:09,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {23053#true} call #t~ret11 := main(); {23053#true} is VALID
[2022-04-08 10:05:09,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {23053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23058#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:09,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {23058#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23059#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:09,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {23059#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23060#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:09,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {23060#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23061#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:09,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {23061#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23062#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:09,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {23062#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23063#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:09,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {23063#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23064#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:09,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {23064#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:09,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:09,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {23066#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:05:09,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {23066#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23067#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:05:09,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {23067#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23068#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:05:09,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {23068#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23069#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {23069#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {23054#false} assume !(~y~0 % 4294967296 > 0); {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L272 TraceCheckUtils]: 27: Hoare triple {23054#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID
[2022-04-08 10:05:09,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID
[2022-04-08 10:05:09,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {23054#false} assume !false; {23054#false} is VALID
[2022-04-08 10:05:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:05:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:05:09,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902714585]
[2022-04-08 10:05:09,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902714585] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:05:09,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609508132]
[2022-04-08 10:05:09,777 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:05:09,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:05:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:05:09,778 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:05:09,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process
[2022-04-08 10:05:09,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-08 10:05:09,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:05:09,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core
[2022-04-08 10:05:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:09,841 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:05:10,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID
[2022-04-08 10:05:10,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23053#true} is VALID
[2022-04-08 10:05:10,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {23053#true} assume true; {23053#true} is VALID
[2022-04-08 10:05:10,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23053#true} {23053#true} #61#return; {23053#true} is VALID
[2022-04-08 10:05:10,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {23053#true} call #t~ret11 := main(); {23053#true} is VALID
[2022-04-08 10:05:10,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {23053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23058#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:10,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {23058#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23059#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:10,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {23059#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23060#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:10,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {23060#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23061#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:10,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {23061#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23062#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:10,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {23062#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23063#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:10,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {23063#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23064#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:10,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {23064#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:10,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:10,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {23066#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:05:10,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {23066#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23067#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:05:10,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {23067#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23068#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:05:10,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {23068#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23125#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:05:10,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {23125#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {23054#false} assume !(~y~0 % 4294967296 > 0); {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L272 TraceCheckUtils]: 27: Hoare triple {23054#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {23054#false} assume !false; {23054#false} is VALID
[2022-04-08 10:05:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:05:10,098 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:05:10,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {23054#false} assume !false; {23054#false} is VALID
[2022-04-08 10:05:10,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID
[2022-04-08 10:05:10,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L272 TraceCheckUtils]: 27: Hoare triple {23054#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {23054#false} assume !(~y~0 % 4294967296 > 0); {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID
[2022-04-08 10:05:10,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {23201#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23054#false} is VALID
[2022-04-08 10:05:10,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {23205#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23201#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:05:10,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {23209#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23205#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:05:10,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {23213#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23209#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:05:10,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {23217#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {23213#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:05:10,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {23217#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23217#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:05:10,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {23224#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23217#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:05:10,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {23228#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23224#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:05:10,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {23232#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23228#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:05:10,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {23236#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23232#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:05:10,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {23240#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23236#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:05:10,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {23244#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23240#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:05:10,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {23248#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23244#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:05:10,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {23053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23248#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:05:10,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {23053#true} call #t~ret11 := main(); {23053#true} is VALID
[2022-04-08 10:05:10,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23053#true} {23053#true} #61#return; {23053#true} is VALID
[2022-04-08 10:05:10,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {23053#true} assume true; {23053#true} is VALID
[2022-04-08 10:05:10,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23053#true} is VALID
[2022-04-08 10:05:10,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID
[2022-04-08 10:05:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:05:10,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609508132] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:05:10,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:05:10,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28
[2022-04-08 10:05:10,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:05:10,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1580583037]
[2022-04-08 10:05:10,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1580583037] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:05:10,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:05:10,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-04-08 10:05:10,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302763119]
[2022-04-08 10:05:10,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:05:10,402 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 10:05:10,402 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:05:10,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:10,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:10,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-04-08 10:05:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:10,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-04-08 10:05:10,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756
[2022-04-08 10:05:10,418 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:11,373 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions.
[2022-04-08 10:05:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2022-04-08 10:05:11,373 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 10:05:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:05:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions.
[2022-04-08 10:05:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions.
[2022-04-08 10:05:11,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 56 transitions.
[2022-04-08 10:05:11,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:11,417 INFO L225 Difference]: With dead ends: 112
[2022-04-08 10:05:11,418 INFO L226 Difference]: Without dead ends: 99
[2022-04-08 10:05:11,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806
[2022-04-08 10:05:11,418 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:05:11,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:05:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2022-04-08 10:05:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90.
[2022-04-08 10:05:11,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:05:11,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:11,518 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:11,519 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:11,520 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions.
[2022-04-08 10:05:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions.
[2022-04-08 10:05:11,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:11,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:11,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states.
[2022-04-08 10:05:11,520 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states.
[2022-04-08 10:05:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:11,521 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions.
[2022-04-08 10:05:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions.
[2022-04-08 10:05:11,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:11,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:11,521 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:05:11,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:05:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions.
[2022-04-08 10:05:11,522 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 31
[2022-04-08 10:05:11,522 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:05:11,522 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions.
[2022-04-08 10:05:11,522 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:11,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 114 transitions.
[2022-04-08 10:05:13,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions.
[2022-04-08 10:05:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 10:05:13,325 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:05:13,325 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:05:13,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0
[2022-04-08 10:05:13,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40
[2022-04-08 10:05:13,526 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:05:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:05:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1135709231, now seen corresponding path program 49 times
[2022-04-08 10:05:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:13,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [924160488]
[2022-04-08 10:05:13,528 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:05:13,529 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:05:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1135709231, now seen corresponding path program 50 times
[2022-04-08 10:05:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:05:13,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444564989]
[2022-04-08 10:05:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:05:13,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:05:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:13,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:05:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:13,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {23917#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23901#true} is VALID
[2022-04-08 10:05:13,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {23901#true} assume true; {23901#true} is VALID
[2022-04-08 10:05:13,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23901#true} {23901#true} #61#return; {23901#true} is VALID
[2022-04-08 10:05:13,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {23901#true} call ULTIMATE.init(); {23917#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:05:13,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {23917#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23901#true} is VALID
[2022-04-08 10:05:13,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {23901#true} assume true; {23901#true} is VALID
[2022-04-08 10:05:13,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23901#true} {23901#true} #61#return; {23901#true} is VALID
[2022-04-08 10:05:13,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {23901#true} call #t~ret11 := main(); {23901#true} is VALID
[2022-04-08 10:05:13,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {23901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23906#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:13,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {23906#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23907#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:13,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {23907#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23908#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:13,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {23908#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23909#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:13,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {23909#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23910#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:13,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {23910#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23911#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:13,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {23911#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23912#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:13,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {23912#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23913#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:13,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {23913#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:05:13,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:05:13,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {23915#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:05:13,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {23915#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23916#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {23916#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {23902#false} assume !(~y~0 % 4294967296 > 0); {23902#false} is VALID
[2022-04-08 10:05:13,685 INFO L272 TraceCheckUtils]: 27: Hoare triple {23902#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23902#false} is VALID
[2022-04-08 10:05:13,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {23902#false} ~cond := #in~cond; {23902#false} is VALID
[2022-04-08 10:05:13,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {23902#false} assume 0 == ~cond; {23902#false} is VALID
[2022-04-08 10:05:13,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {23902#false} assume !false; {23902#false} is VALID
[2022-04-08 10:05:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:05:13,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:05:13,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444564989]
[2022-04-08 10:05:13,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444564989] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:05:13,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732043864]
[2022-04-08 10:05:13,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:05:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:05:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:05:13,688 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:05:13,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process
[2022-04-08 10:05:13,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:05:13,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:05:13,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjunts are in the unsatisfiable core
[2022-04-08 10:05:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:13,732 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:05:13,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {23901#true} call ULTIMATE.init(); {23901#true} is VALID
[2022-04-08 10:05:13,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {23901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23901#true} is VALID
[2022-04-08 10:05:13,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {23901#true} assume true; {23901#true} is VALID
[2022-04-08 10:05:13,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23901#true} {23901#true} #61#return; {23901#true} is VALID
[2022-04-08 10:05:13,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {23901#true} call #t~ret11 := main(); {23901#true} is VALID
[2022-04-08 10:05:13,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {23901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23906#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:13,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {23906#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23907#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:13,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {23907#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23908#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:13,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {23908#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23909#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:13,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {23909#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23910#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:13,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {23910#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23911#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:13,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {23911#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23912#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:13,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {23912#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23913#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:13,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {23913#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:05:13,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:05:13,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {23915#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:05:13,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {23915#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23969#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:05:13,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {23969#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23902#false} is VALID
[2022-04-08 10:05:13,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:13,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {23902#false} assume !(~y~0 % 4294967296 > 0); {23902#false} is VALID
[2022-04-08 10:05:13,948 INFO L272 TraceCheckUtils]: 27: Hoare triple {23902#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23902#false} is VALID
[2022-04-08 10:05:13,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {23902#false} ~cond := #in~cond; {23902#false} is VALID
[2022-04-08 10:05:13,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {23902#false} assume 0 == ~cond; {23902#false} is VALID
[2022-04-08 10:05:13,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {23902#false} assume !false; {23902#false} is VALID
[2022-04-08 10:05:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:05:13,948 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:05:14,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {23902#false} assume !false; {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {23902#false} assume 0 == ~cond; {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {23902#false} ~cond := #in~cond; {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L272 TraceCheckUtils]: 27: Hoare triple {23902#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {23902#false} assume !(~y~0 % 4294967296 > 0); {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:14,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:14,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID
[2022-04-08 10:05:14,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {24051#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23902#false} is VALID
[2022-04-08 10:05:14,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {24055#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24051#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:05:14,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {24059#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {24055#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:05:14,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {24059#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {24059#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:05:14,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {24066#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24059#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:05:14,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {24070#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24066#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:05:14,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {24074#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24070#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:05:14,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {24078#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24074#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:05:14,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {24082#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24078#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:05:14,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {24086#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24082#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:05:14,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {24090#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24086#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:05:14,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {24094#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24090#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:05:14,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {23901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24094#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:05:14,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {23901#true} call #t~ret11 := main(); {23901#true} is VALID
[2022-04-08 10:05:14,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23901#true} {23901#true} #61#return; {23901#true} is VALID
[2022-04-08 10:05:14,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {23901#true} assume true; {23901#true} is VALID
[2022-04-08 10:05:14,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {23901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23901#true} is VALID
[2022-04-08 10:05:14,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {23901#true} call ULTIMATE.init(); {23901#true} is VALID
[2022-04-08 10:05:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:05:14,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732043864] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:05:14,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:05:14,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26
[2022-04-08 10:05:14,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:05:14,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [924160488]
[2022-04-08 10:05:14,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [924160488] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:05:14,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:05:14,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-04-08 10:05:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946364089]
[2022-04-08 10:05:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:05:14,217 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 10:05:14,217 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:05:14,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:14,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:14,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-04-08 10:05:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:14,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-04-08 10:05:14,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650
[2022-04-08 10:05:14,233 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:15,025 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions.
[2022-04-08 10:05:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2022-04-08 10:05:15,026 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 10:05:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:05:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions.
[2022-04-08 10:05:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions.
[2022-04-08 10:05:15,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions.
[2022-04-08 10:05:15,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:15,071 INFO L225 Difference]: With dead ends: 115
[2022-04-08 10:05:15,071 INFO L226 Difference]: Without dead ends: 101
[2022-04-08 10:05:15,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406
[2022-04-08 10:05:15,071 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:05:15,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 71 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:05:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2022-04-08 10:05:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91.
[2022-04-08 10:05:15,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:05:15,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:15,171 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:15,172 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:15,172 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions.
[2022-04-08 10:05:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions.
[2022-04-08 10:05:15,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:15,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:15,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states.
[2022-04-08 10:05:15,173 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states.
[2022-04-08 10:05:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:15,174 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions.
[2022-04-08 10:05:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions.
[2022-04-08 10:05:15,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:15,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:15,174 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:05:15,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:05:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions.
[2022-04-08 10:05:15,175 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 31
[2022-04-08 10:05:15,175 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:05:15,175 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions.
[2022-04-08 10:05:15,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:15,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 115 transitions.
[2022-04-08 10:05:16,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions.
[2022-04-08 10:05:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 10:05:16,638 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:05:16,638 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:05:16,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0
[2022-04-08 10:05:16,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:05:16,843 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:05:16,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:05:16,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2103029678, now seen corresponding path program 33 times
[2022-04-08 10:05:16,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:16,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531920642]
[2022-04-08 10:05:16,846 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:05:16,846 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:05:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2103029678, now seen corresponding path program 34 times
[2022-04-08 10:05:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:05:16,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64002584]
[2022-04-08 10:05:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:05:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:05:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:17,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:05:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:17,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {24777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24753#true} is VALID
[2022-04-08 10:05:17,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {24753#true} assume true; {24753#true} is VALID
[2022-04-08 10:05:17,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24753#true} {24753#true} #61#return; {24753#true} is VALID
[2022-04-08 10:05:17,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {24753#true} call ULTIMATE.init(); {24777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:05:17,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {24777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24753#true} is VALID
[2022-04-08 10:05:17,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {24753#true} assume true; {24753#true} is VALID
[2022-04-08 10:05:17,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24753#true} {24753#true} #61#return; {24753#true} is VALID
[2022-04-08 10:05:17,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {24753#true} call #t~ret11 := main(); {24753#true} is VALID
[2022-04-08 10:05:17,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {24753#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24758#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:17,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {24758#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24759#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:17,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {24759#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:17,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {24760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24761#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:17,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {24761#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24762#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:17,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {24762#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:17,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {24763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24764#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:17,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {24764#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24765#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:17,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {24765#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24766#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:05:17,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {24766#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24767#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:05:17,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {24767#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24768#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:05:17,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {24768#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24769#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:05:17,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {24769#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24770#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:05:17,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {24770#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24771#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:05:17,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {24771#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24772#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:05:17,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {24772#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24773#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:05:17,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {24773#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24774#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:05:17,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {24774#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:05:17,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:05:17,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {24776#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID
[2022-04-08 10:05:17,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {24776#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24754#false} is VALID
[2022-04-08 10:05:17,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {24754#false} assume !(~y~0 % 4294967296 > 0); {24754#false} is VALID
[2022-04-08 10:05:17,162 INFO L272 TraceCheckUtils]: 27: Hoare triple {24754#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24754#false} is VALID
[2022-04-08 10:05:17,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {24754#false} ~cond := #in~cond; {24754#false} is VALID
[2022-04-08 10:05:17,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {24754#false} assume 0 == ~cond; {24754#false} is VALID
[2022-04-08 10:05:17,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {24754#false} assume !false; {24754#false} is VALID
[2022-04-08 10:05:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:05:17,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:05:17,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64002584]
[2022-04-08 10:05:17,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64002584] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:05:17,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591624399]
[2022-04-08 10:05:17,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:05:17,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:05:17,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:05:17,164 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:05:17,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process
[2022-04-08 10:05:17,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:05:17,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:05:17,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 39 conjunts are in the unsatisfiable core
[2022-04-08 10:05:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:17,210 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:05:17,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {24753#true} call ULTIMATE.init(); {24753#true} is VALID
[2022-04-08 10:05:17,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {24753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24753#true} is VALID
[2022-04-08 10:05:17,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {24753#true} assume true; {24753#true} is VALID
[2022-04-08 10:05:17,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24753#true} {24753#true} #61#return; {24753#true} is VALID
[2022-04-08 10:05:17,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {24753#true} call #t~ret11 := main(); {24753#true} is VALID
[2022-04-08 10:05:17,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {24753#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24758#(= main_~y~0 0)} is VALID
[2022-04-08 10:05:17,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {24758#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24759#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:17,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {24759#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:05:17,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {24760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24761#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:05:17,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {24761#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24762#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:05:17,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {24762#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:17,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {24763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24764#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:17,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {24764#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24765#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:05:17,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {24765#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24766#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:05:17,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {24766#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24767#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:05:17,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {24767#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24768#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:05:17,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {24768#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24769#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:05:17,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {24769#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24770#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:05:17,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {24770#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24771#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:05:17,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {24771#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24772#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:05:17,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {24772#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24773#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:05:17,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {24773#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24774#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:05:17,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {24774#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:05:17,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:05:17,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {24853#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID
[2022-04-08 10:05:17,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {24853#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {24754#false} is VALID
[2022-04-08 10:05:17,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {24754#false} assume !(~y~0 % 4294967296 > 0); {24754#false} is VALID
[2022-04-08 10:05:17,495 INFO L272 TraceCheckUtils]: 27: Hoare triple {24754#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24754#false} is VALID
[2022-04-08 10:05:17,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {24754#false} ~cond := #in~cond; {24754#false} is VALID
[2022-04-08 10:05:17,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {24754#false} assume 0 == ~cond; {24754#false} is VALID
[2022-04-08 10:05:17,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {24754#false} assume !false; {24754#false} is VALID
[2022-04-08 10:05:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:05:17,496 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:05:18,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {24754#false} assume !false; {24754#false} is VALID
[2022-04-08 10:05:18,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {24754#false} assume 0 == ~cond; {24754#false} is VALID
[2022-04-08 10:05:18,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {24754#false} ~cond := #in~cond; {24754#false} is VALID
[2022-04-08 10:05:18,131 INFO L272 TraceCheckUtils]: 27: Hoare triple {24754#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24754#false} is VALID
[2022-04-08 10:05:18,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {24754#false} assume !(~y~0 % 4294967296 > 0); {24754#false} is VALID
[2022-04-08 10:05:18,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {24887#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24754#false} is VALID
[2022-04-08 10:05:18,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {24891#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {24887#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:05:18,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {24891#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24891#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:05:18,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {24898#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24891#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:05:18,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {24902#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24898#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:05:18,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {24906#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24902#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:05:18,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {24910#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24906#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:05:18,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {24914#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24910#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:05:18,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {24918#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24914#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:05:18,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {24922#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24918#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:05:18,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {24926#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24922#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:05:18,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {24930#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24926#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:05:18,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {24934#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24930#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:05:18,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {24938#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24934#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:05:18,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {24942#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24938#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:05:18,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {24946#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24942#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:05:18,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {24950#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24946#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:05:18,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {24954#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24950#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:05:18,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {24958#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24954#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:05:18,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {24962#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24958#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:05:18,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {24753#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24962#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:05:18,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {24753#true} call #t~ret11 := main(); {24753#true} is VALID
[2022-04-08 10:05:18,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24753#true} {24753#true} #61#return; {24753#true} is VALID
[2022-04-08 10:05:18,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {24753#true} assume true; {24753#true} is VALID
[2022-04-08 10:05:18,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {24753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24753#true} is VALID
[2022-04-08 10:05:18,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {24753#true} call ULTIMATE.init(); {24753#true} is VALID
[2022-04-08 10:05:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:05:18,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591624399] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:05:18,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:05:18,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42
[2022-04-08 10:05:18,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:05:18,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531920642]
[2022-04-08 10:05:18,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531920642] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:05:18,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:05:18,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2022-04-08 10:05:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861718968]
[2022-04-08 10:05:18,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:05:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 10:05:18,145 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:05:18,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:18,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:18,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2022-04-08 10:05:18,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:18,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2022-04-08 10:05:18,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722
[2022-04-08 10:05:18,163 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:20,917 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions.
[2022-04-08 10:05:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-04-08 10:05:20,917 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31
[2022-04-08 10:05:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:05:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions.
[2022-04-08 10:05:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions.
[2022-04-08 10:05:20,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 128 transitions.
[2022-04-08 10:05:21,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:21,023 INFO L225 Difference]: With dead ends: 120
[2022-04-08 10:05:21,024 INFO L226 Difference]: Without dead ends: 114
[2022-04-08 10:05:21,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660
[2022-04-08 10:05:21,025 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 108 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:05:21,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 142 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-04-08 10:05:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2022-04-08 10:05:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96.
[2022-04-08 10:05:21,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:05:21,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:21,124 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:21,126 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:21,128 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions.
[2022-04-08 10:05:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions.
[2022-04-08 10:05:21,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:21,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:21,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states.
[2022-04-08 10:05:21,129 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states.
[2022-04-08 10:05:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:05:21,130 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions.
[2022-04-08 10:05:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions.
[2022-04-08 10:05:21,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:05:21,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:05:21,130 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:05:21,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:05:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions.
[2022-04-08 10:05:21,132 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 31
[2022-04-08 10:05:21,132 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:05:21,132 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions.
[2022-04-08 10:05:21,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:21,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 122 transitions.
[2022-04-08 10:05:21,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions.
[2022-04-08 10:05:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-08 10:05:21,789 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:05:21,789 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:05:21,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0
[2022-04-08 10:05:21,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:05:21,990 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:05:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:05:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 51 times
[2022-04-08 10:05:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:21,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146674843]
[2022-04-08 10:05:21,993 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:05:21,993 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:05:21,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 52 times
[2022-04-08 10:05:21,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:05:21,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422060532]
[2022-04-08 10:05:21,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:05:21,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:05:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:22,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:05:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:22,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {25704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25681#true} is VALID
[2022-04-08 10:05:22,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {25681#true} assume true; {25681#true} is VALID
[2022-04-08 10:05:22,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25681#true} {25681#true} #61#return; {25681#true} is VALID
[2022-04-08 10:05:22,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {25681#true} call ULTIMATE.init(); {25704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:05:22,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {25704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25681#true} is VALID
[2022-04-08 10:05:22,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {25681#true} assume true; {25681#true} is VALID
[2022-04-08 10:05:22,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25681#true} {25681#true} #61#return; {25681#true} is VALID
[2022-04-08 10:05:22,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {25681#true} call #t~ret11 := main(); {25681#true} is VALID
[2022-04-08 10:05:22,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {25681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25686#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:05:22,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {25686#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25687#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:22,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {25687#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25688#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:05:22,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {25688#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25689#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:22,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {25689#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25690#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:05:22,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {25690#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25691#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:22,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {25691#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25692#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 6) main_~n~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:05:22,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {25692#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 6) main_~n~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {25693#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:22,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {25693#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} ~z~0 := ~y~0; {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:22,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:22,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID
[2022-04-08 10:05:22,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:05:22,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:05:22,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID
[2022-04-08 10:05:22,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:22,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:22,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID
[2022-04-08 10:05:22,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:05:22,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:05:22,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID
[2022-04-08 10:05:22,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:22,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:22,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:22,745 INFO L272 TraceCheckUtils]: 28: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:05:22,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {25702#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25703#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:05:22,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {25703#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25682#false} is VALID
[2022-04-08 10:05:22,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {25682#false} assume !false; {25682#false} is VALID
[2022-04-08 10:05:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:05:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:05:22,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422060532]
[2022-04-08 10:05:22,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422060532] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:05:22,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827765700]
[2022-04-08 10:05:22,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:05:22,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:05:22,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:05:22,748 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:05:22,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process
[2022-04-08 10:05:22,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:05:22,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:05:22,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 61 conjunts are in the unsatisfiable core
[2022-04-08 10:05:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:05:22,978 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:05:48,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {25681#true} call ULTIMATE.init(); {25681#true} is VALID
[2022-04-08 10:05:48,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {25681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25681#true} is VALID
[2022-04-08 10:05:48,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {25681#true} assume true; {25681#true} is VALID
[2022-04-08 10:05:48,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25681#true} {25681#true} #61#return; {25681#true} is VALID
[2022-04-08 10:05:48,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {25681#true} call #t~ret11 := main(); {25681#true} is VALID
[2022-04-08 10:05:48,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {25681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25686#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:05:48,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {25686#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25687#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:05:48,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {25687#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25688#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:05:48,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {25688#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25689#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:48,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {25689#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25735#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:48,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {25735#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25739#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} is VALID
[2022-04-08 10:05:48,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {25739#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25743#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {25743#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {25693#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {25693#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} ~z~0 := ~y~0; {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:05:48,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:05:48,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID
[2022-04-08 10:05:48,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID
[2022-04-08 10:05:48,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:05:48,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:05:48,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID
[2022-04-08 10:05:48,457 INFO L272 TraceCheckUtils]: 28: Hoare triple {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:05:48,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {25795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25799#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:05:48,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {25799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25682#false} is VALID
[2022-04-08 10:05:48,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {25682#false} assume !false; {25682#false} is VALID
[2022-04-08 10:05:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:05:48,458 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:05:58,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {25682#false} assume !false; {25682#false} is VALID
[2022-04-08 10:05:58,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {25799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25682#false} is VALID
[2022-04-08 10:05:58,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {25795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25799#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:05:58,606 INFO L272 TraceCheckUtils]: 28: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:05:58,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:58,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {25821#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:58,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {25825#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25821#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:58,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {25829#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25825#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:05:58,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {25833#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25829#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:58,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {25837#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25833#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:05:58,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {25841#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25837#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:58,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {25841#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {25841#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:05:58,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {25837#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25841#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:05:58,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {25833#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25837#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:58,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {25829#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25833#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:05:58,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {25825#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25829#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:58,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {25821#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25825#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:05:58,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25821#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:58,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {25866#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:05:58,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {25870#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {25866#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:05:58,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {25874#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25870#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:05:58,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {25878#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25874#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:05:58,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {25882#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25878#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:05:58,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {25886#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25882#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:05:58,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {25890#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25886#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:05:58,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {25894#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25890#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:05:58,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {25681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25894#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:05:58,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {25681#true} call #t~ret11 := main(); {25681#true} is VALID
[2022-04-08 10:05:58,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25681#true} {25681#true} #61#return; {25681#true} is VALID
[2022-04-08 10:05:58,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {25681#true} assume true; {25681#true} is VALID
[2022-04-08 10:05:58,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {25681#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25681#true} is VALID
[2022-04-08 10:05:58,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {25681#true} call ULTIMATE.init(); {25681#true} is VALID
[2022-04-08 10:05:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:05:58,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827765700] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:05:58,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:05:58,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 40
[2022-04-08 10:05:58,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:05:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146674843]
[2022-04-08 10:05:58,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146674843] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:05:58,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:05:58,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2022-04-08 10:05:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855747330]
[2022-04-08 10:05:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:05:58,629 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 10:05:58,629 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:05:58,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:05:58,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:05:58,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2022-04-08 10:05:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:05:58,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2022-04-08 10:05:58,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1404, Unknown=2, NotChecked=0, Total=1560
[2022-04-08 10:05:58,930 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:01,782 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions.
[2022-04-08 10:06:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2022-04-08 10:06:01,782 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 10:06:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 52 transitions.
[2022-04-08 10:06:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 52 transitions.
[2022-04-08 10:06:01,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 52 transitions.
[2022-04-08 10:06:01,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:01,883 INFO L225 Difference]: With dead ends: 119
[2022-04-08 10:06:01,883 INFO L226 Difference]: Without dead ends: 88
[2022-04-08 10:06:01,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=358, Invalid=3546, Unknown=2, NotChecked=0, Total=3906
[2022-04-08 10:06:01,883 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:01,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 99 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:06:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2022-04-08 10:06:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2022-04-08 10:06:01,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:01,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:01,975 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:01,975 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:01,976 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions.
[2022-04-08 10:06:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions.
[2022-04-08 10:06:01,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:01,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:01,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states.
[2022-04-08 10:06:01,976 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states.
[2022-04-08 10:06:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:01,977 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions.
[2022-04-08 10:06:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions.
[2022-04-08 10:06:01,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:01,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:01,977 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:01,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions.
[2022-04-08 10:06:01,978 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 32
[2022-04-08 10:06:01,979 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:01,979 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions.
[2022-04-08 10:06:01,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:01,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 112 transitions.
[2022-04-08 10:06:03,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions.
[2022-04-08 10:06:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-08 10:06:03,596 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:03,596 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:03,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:03,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43
[2022-04-08 10:06:03,796 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash -316309121, now seen corresponding path program 53 times
[2022-04-08 10:06:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:03,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [45323528]
[2022-04-08 10:06:03,799 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:03,799 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash -316309121, now seen corresponding path program 54 times
[2022-04-08 10:06:03,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:03,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34413247]
[2022-04-08 10:06:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:03,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:04,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {26569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26551#true} is VALID
[2022-04-08 10:06:04,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {26551#true} assume true; {26551#true} is VALID
[2022-04-08 10:06:04,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26551#true} {26551#true} #61#return; {26551#true} is VALID
[2022-04-08 10:06:04,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {26551#true} call ULTIMATE.init(); {26569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:04,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {26569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26551#true} is VALID
[2022-04-08 10:06:04,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#true} assume true; {26551#true} is VALID
[2022-04-08 10:06:04,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#true} {26551#true} #61#return; {26551#true} is VALID
[2022-04-08 10:06:04,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#true} call #t~ret11 := main(); {26551#true} is VALID
[2022-04-08 10:06:04,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26556#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:04,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {26556#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26557#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:04,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {26557#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26558#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:04,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {26558#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26559#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:04,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {26559#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26560#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:04,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {26560#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26561#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:04,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {26561#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26562#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:04,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {26562#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:04,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:04,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {26564#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:04,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {26564#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26565#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:06:04,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {26565#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26566#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:06:04,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {26566#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26567#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:06:04,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {26567#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26568#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:06:04,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {26568#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {26552#false} is VALID
[2022-04-08 10:06:04,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {26552#false} assume !(~y~0 % 4294967296 > 0); {26552#false} is VALID
[2022-04-08 10:06:04,012 INFO L272 TraceCheckUtils]: 28: Hoare triple {26552#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26552#false} is VALID
[2022-04-08 10:06:04,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {26552#false} ~cond := #in~cond; {26552#false} is VALID
[2022-04-08 10:06:04,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {26552#false} assume 0 == ~cond; {26552#false} is VALID
[2022-04-08 10:06:04,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {26552#false} assume !false; {26552#false} is VALID
[2022-04-08 10:06:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:06:04,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:04,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34413247]
[2022-04-08 10:06:04,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34413247] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:04,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222502380]
[2022-04-08 10:06:04,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:06:04,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:04,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:04,014 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:04,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process
[2022-04-08 10:06:04,079 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-08 10:06:04,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:04,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 36 conjunts are in the unsatisfiable core
[2022-04-08 10:06:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:04,088 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:04,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {26551#true} call ULTIMATE.init(); {26551#true} is VALID
[2022-04-08 10:06:04,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {26551#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26551#true} is VALID
[2022-04-08 10:06:04,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#true} assume true; {26551#true} is VALID
[2022-04-08 10:06:04,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#true} {26551#true} #61#return; {26551#true} is VALID
[2022-04-08 10:06:04,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#true} call #t~ret11 := main(); {26551#true} is VALID
[2022-04-08 10:06:04,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26556#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:04,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {26556#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26557#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:04,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {26557#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26558#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:04,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {26558#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26559#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:04,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {26559#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26560#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:04,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {26560#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26561#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:04,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {26561#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26562#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:04,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {26562#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:04,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:04,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {26615#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:04,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {26615#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26619#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:06:04,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {26619#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26623#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 10:06:04,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {26623#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26627#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:04,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {26627#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26631#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {26631#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~z~0 % 4294967296 > 0); {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {26552#false} assume !(~y~0 % 4294967296 > 0); {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L272 TraceCheckUtils]: 28: Hoare triple {26552#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {26552#false} ~cond := #in~cond; {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {26552#false} assume 0 == ~cond; {26552#false} is VALID
[2022-04-08 10:06:04,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {26552#false} assume !false; {26552#false} is VALID
[2022-04-08 10:06:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:06:04,313 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:04,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {26552#false} assume !false; {26552#false} is VALID
[2022-04-08 10:06:04,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {26552#false} assume 0 == ~cond; {26552#false} is VALID
[2022-04-08 10:06:04,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {26552#false} ~cond := #in~cond; {26552#false} is VALID
[2022-04-08 10:06:04,621 INFO L272 TraceCheckUtils]: 28: Hoare triple {26552#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26552#false} is VALID
[2022-04-08 10:06:04,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {26552#false} assume !(~y~0 % 4294967296 > 0); {26552#false} is VALID
[2022-04-08 10:06:04,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {26692#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID
[2022-04-08 10:06:04,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {26696#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26692#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:06:04,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {26700#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26696#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:06:04,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {26704#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26700#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:06:04,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {26708#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:06:04,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {26712#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {26708#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:06:04,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {26716#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26712#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:04,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {26720#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26716#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:04,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {26724#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26720#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:04,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {26728#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26724#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:04,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {26551#true} ~z~0 := ~y~0; {26728#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:04,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {26551#true} assume !(~x~0 % 4294967296 > 0); {26551#true} is VALID
[2022-04-08 10:06:04,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {26551#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26551#true} is VALID
[2022-04-08 10:06:04,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {26551#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26551#true} is VALID
[2022-04-08 10:06:04,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {26551#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26551#true} is VALID
[2022-04-08 10:06:04,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {26551#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26551#true} is VALID
[2022-04-08 10:06:04,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {26551#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26551#true} is VALID
[2022-04-08 10:06:04,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {26551#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26551#true} is VALID
[2022-04-08 10:06:04,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {26551#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26551#true} is VALID
[2022-04-08 10:06:04,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26551#true} is VALID
[2022-04-08 10:06:04,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#true} call #t~ret11 := main(); {26551#true} is VALID
[2022-04-08 10:06:04,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#true} {26551#true} #61#return; {26551#true} is VALID
[2022-04-08 10:06:04,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#true} assume true; {26551#true} is VALID
[2022-04-08 10:06:04,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {26551#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26551#true} is VALID
[2022-04-08 10:06:04,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {26551#true} call ULTIMATE.init(); {26551#true} is VALID
[2022-04-08 10:06:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2022-04-08 10:06:04,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222502380] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:04,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:04,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 12] total 31
[2022-04-08 10:06:04,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:04,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [45323528]
[2022-04-08 10:06:04,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [45323528] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:04,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:04,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-04-08 10:06:04,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197602178]
[2022-04-08 10:06:04,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 10:06:04,631 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:04,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:04,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:04,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-04-08 10:06:04,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-04-08 10:06:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930
[2022-04-08 10:06:04,648 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:05,564 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions.
[2022-04-08 10:06:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-04-08 10:06:05,564 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 10:06:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 50 transitions.
[2022-04-08 10:06:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 50 transitions.
[2022-04-08 10:06:05,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 50 transitions.
[2022-04-08 10:06:05,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:05,602 INFO L225 Difference]: With dead ends: 111
[2022-04-08 10:06:05,602 INFO L226 Difference]: Without dead ends: 98
[2022-04-08 10:06:05,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892
[2022-04-08 10:06:05,603 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:05,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:06:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2022-04-08 10:06:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89.
[2022-04-08 10:06:05,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:05,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:05,700 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:05,700 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:05,701 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions.
[2022-04-08 10:06:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions.
[2022-04-08 10:06:05,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:05,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:05,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states.
[2022-04-08 10:06:05,701 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states.
[2022-04-08 10:06:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:05,702 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions.
[2022-04-08 10:06:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions.
[2022-04-08 10:06:05,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:05,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:05,702 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:05,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions.
[2022-04-08 10:06:05,703 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 32
[2022-04-08 10:06:05,703 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:05,703 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions.
[2022-04-08 10:06:05,703 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:05,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 113 transitions.
[2022-04-08 10:06:08,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 112 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions.
[2022-04-08 10:06:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-08 10:06:08,468 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:08,468 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:08,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:08,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44
[2022-04-08 10:06:08,669 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1879174029, now seen corresponding path program 55 times
[2022-04-08 10:06:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:08,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667529624]
[2022-04-08 10:06:08,671 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:08,671 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1879174029, now seen corresponding path program 56 times
[2022-04-08 10:06:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:08,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188162554]
[2022-04-08 10:06:08,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:08,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {27415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27398#true} is VALID
[2022-04-08 10:06:08,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {27398#true} assume true; {27398#true} is VALID
[2022-04-08 10:06:08,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27398#true} {27398#true} #61#return; {27398#true} is VALID
[2022-04-08 10:06:08,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {27398#true} call ULTIMATE.init(); {27415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:08,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {27415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27398#true} is VALID
[2022-04-08 10:06:08,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {27398#true} assume true; {27398#true} is VALID
[2022-04-08 10:06:08,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27398#true} {27398#true} #61#return; {27398#true} is VALID
[2022-04-08 10:06:08,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {27398#true} call #t~ret11 := main(); {27398#true} is VALID
[2022-04-08 10:06:08,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {27398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27403#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:08,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {27403#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:08,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {27404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:08,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {27405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:08,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {27406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:08,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {27407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:08,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {27408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:08,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {27409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:08,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {27410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:08,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:08,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27412#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:06:08,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {27412#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27413#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:08,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {27413#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27414#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:06:08,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {27414#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27399#false} is VALID
[2022-04-08 10:06:08,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {27399#false} assume !(~y~0 % 4294967296 > 0); {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L272 TraceCheckUtils]: 28: Hoare triple {27399#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {27399#false} ~cond := #in~cond; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {27399#false} assume 0 == ~cond; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {27399#false} assume !false; {27399#false} is VALID
[2022-04-08 10:06:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:06:08,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:08,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188162554]
[2022-04-08 10:06:08,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188162554] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:08,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70208964]
[2022-04-08 10:06:08,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:06:08,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:08,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:08,888 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:08,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process
[2022-04-08 10:06:08,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:06:08,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:08,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjunts are in the unsatisfiable core
[2022-04-08 10:06:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:08,933 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:09,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {27398#true} call ULTIMATE.init(); {27398#true} is VALID
[2022-04-08 10:06:09,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {27398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27398#true} is VALID
[2022-04-08 10:06:09,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {27398#true} assume true; {27398#true} is VALID
[2022-04-08 10:06:09,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27398#true} {27398#true} #61#return; {27398#true} is VALID
[2022-04-08 10:06:09,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {27398#true} call #t~ret11 := main(); {27398#true} is VALID
[2022-04-08 10:06:09,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {27398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27403#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:09,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {27403#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:09,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {27404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:09,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {27405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:09,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {27406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:09,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {27407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:09,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {27408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:09,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {27409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:09,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {27410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:09,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:09,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27412#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:06:09,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {27412#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27413#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:09,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {27413#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27470#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:06:09,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {27470#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27399#false} is VALID
[2022-04-08 10:06:09,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {27399#false} assume !(~y~0 % 4294967296 > 0); {27399#false} is VALID
[2022-04-08 10:06:09,168 INFO L272 TraceCheckUtils]: 28: Hoare triple {27399#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27399#false} is VALID
[2022-04-08 10:06:09,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {27399#false} ~cond := #in~cond; {27399#false} is VALID
[2022-04-08 10:06:09,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {27399#false} assume 0 == ~cond; {27399#false} is VALID
[2022-04-08 10:06:09,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {27399#false} assume !false; {27399#false} is VALID
[2022-04-08 10:06:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:06:09,168 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:09,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {27399#false} assume !false; {27399#false} is VALID
[2022-04-08 10:06:09,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {27399#false} assume 0 == ~cond; {27399#false} is VALID
[2022-04-08 10:06:09,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {27399#false} ~cond := #in~cond; {27399#false} is VALID
[2022-04-08 10:06:09,457 INFO L272 TraceCheckUtils]: 28: Hoare triple {27399#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27399#false} is VALID
[2022-04-08 10:06:09,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {27399#false} assume !(~y~0 % 4294967296 > 0); {27399#false} is VALID
[2022-04-08 10:06:09,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID
[2022-04-08 10:06:09,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {27552#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27399#false} is VALID
[2022-04-08 10:06:09,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {27556#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27552#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:06:09,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {27560#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27556#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:09,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {27564#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {27560#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:09,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {27564#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {27564#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:09,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {27571#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27564#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:09,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {27575#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27571#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:09,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {27579#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27575#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:06:09,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {27583#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27579#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:06:09,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {27587#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27583#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:06:09,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {27591#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27587#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:06:09,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {27595#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27591#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:06:09,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {27599#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27595#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:09,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {27398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27599#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:06:09,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {27398#true} call #t~ret11 := main(); {27398#true} is VALID
[2022-04-08 10:06:09,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27398#true} {27398#true} #61#return; {27398#true} is VALID
[2022-04-08 10:06:09,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {27398#true} assume true; {27398#true} is VALID
[2022-04-08 10:06:09,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {27398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27398#true} is VALID
[2022-04-08 10:06:09,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {27398#true} call ULTIMATE.init(); {27398#true} is VALID
[2022-04-08 10:06:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:06:09,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70208964] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:09,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:09,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28
[2022-04-08 10:06:09,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:09,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667529624]
[2022-04-08 10:06:09,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667529624] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:09,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:09,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-04-08 10:06:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268750292]
[2022-04-08 10:06:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:09,476 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 10:06:09,477 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:09,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:09,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:09,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-04-08 10:06:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:09,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-04-08 10:06:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756
[2022-04-08 10:06:09,492 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:10,326 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions.
[2022-04-08 10:06:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-04-08 10:06:10,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 10:06:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 56 transitions.
[2022-04-08 10:06:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 56 transitions.
[2022-04-08 10:06:10,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 56 transitions.
[2022-04-08 10:06:10,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:10,373 INFO L225 Difference]: With dead ends: 114
[2022-04-08 10:06:10,373 INFO L226 Difference]: Without dead ends: 100
[2022-04-08 10:06:10,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=356, Invalid=1366, Unknown=0, NotChecked=0, Total=1722
[2022-04-08 10:06:10,373 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:10,373 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:06:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2022-04-08 10:06:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90.
[2022-04-08 10:06:10,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:10,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:10,463 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:10,463 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:10,464 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions.
[2022-04-08 10:06:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions.
[2022-04-08 10:06:10,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:10,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:10,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states.
[2022-04-08 10:06:10,464 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states.
[2022-04-08 10:06:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:10,465 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions.
[2022-04-08 10:06:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions.
[2022-04-08 10:06:10,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:10,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:10,465 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:10,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions.
[2022-04-08 10:06:10,466 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 32
[2022-04-08 10:06:10,466 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:10,466 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions.
[2022-04-08 10:06:10,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:10,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 114 transitions.
[2022-04-08 10:06:16,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 113 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions.
[2022-04-08 10:06:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-08 10:06:16,169 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:16,169 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:16,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:16,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45
[2022-04-08 10:06:16,369 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:16,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1622266477, now seen corresponding path program 35 times
[2022-04-08 10:06:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:16,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1947833435]
[2022-04-08 10:06:16,371 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:16,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1622266477, now seen corresponding path program 36 times
[2022-04-08 10:06:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:16,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011625519]
[2022-04-08 10:06:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:16,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:16,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {28281#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28256#true} is VALID
[2022-04-08 10:06:16,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {28256#true} assume true; {28256#true} is VALID
[2022-04-08 10:06:16,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28256#true} {28256#true} #61#return; {28256#true} is VALID
[2022-04-08 10:06:16,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {28256#true} call ULTIMATE.init(); {28281#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:16,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {28281#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28256#true} is VALID
[2022-04-08 10:06:16,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {28256#true} assume true; {28256#true} is VALID
[2022-04-08 10:06:16,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28256#true} {28256#true} #61#return; {28256#true} is VALID
[2022-04-08 10:06:16,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {28256#true} call #t~ret11 := main(); {28256#true} is VALID
[2022-04-08 10:06:16,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {28256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28261#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:16,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {28261#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:16,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {28262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:16,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {28263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:16,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {28264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:16,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {28265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:16,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {28266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:16,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {28267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:16,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {28268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28269#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:16,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {28269#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:16,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {28270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28271#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:06:16,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {28271#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28272#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:06:16,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {28272#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28273#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:06:16,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {28273#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28274#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:06:16,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {28274#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28275#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:06:16,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {28275#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28276#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:06:16,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {28276#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28277#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:06:16,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {28277#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28278#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:06:16,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {28278#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:06:16,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:06:16,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {28280#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID
[2022-04-08 10:06:16,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {28280#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {28257#false} is VALID
[2022-04-08 10:06:16,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {28257#false} assume !(~y~0 % 4294967296 > 0); {28257#false} is VALID
[2022-04-08 10:06:16,716 INFO L272 TraceCheckUtils]: 28: Hoare triple {28257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28257#false} is VALID
[2022-04-08 10:06:16,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {28257#false} ~cond := #in~cond; {28257#false} is VALID
[2022-04-08 10:06:16,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {28257#false} assume 0 == ~cond; {28257#false} is VALID
[2022-04-08 10:06:16,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {28257#false} assume !false; {28257#false} is VALID
[2022-04-08 10:06:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:06:16,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:16,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011625519]
[2022-04-08 10:06:16,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011625519] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:16,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277740537]
[2022-04-08 10:06:16,717 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:06:16,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:16,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:16,718 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:16,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process
[2022-04-08 10:06:16,991 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s)
[2022-04-08 10:06:16,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:16,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 41 conjunts are in the unsatisfiable core
[2022-04-08 10:06:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:17,000 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:17,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {28256#true} call ULTIMATE.init(); {28256#true} is VALID
[2022-04-08 10:06:17,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {28256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28256#true} is VALID
[2022-04-08 10:06:17,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {28256#true} assume true; {28256#true} is VALID
[2022-04-08 10:06:17,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28256#true} {28256#true} #61#return; {28256#true} is VALID
[2022-04-08 10:06:17,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {28256#true} call #t~ret11 := main(); {28256#true} is VALID
[2022-04-08 10:06:17,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {28256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28261#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:17,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {28261#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:17,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {28262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:17,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {28263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:17,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {28264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:17,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {28265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:17,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {28266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:17,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {28267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:17,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {28268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28269#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:17,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {28269#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:17,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {28270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28271#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:06:17,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {28271#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28272#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:06:17,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {28272#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28273#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:06:17,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {28273#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28274#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:06:17,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {28274#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28275#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:06:17,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {28275#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28276#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:06:17,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {28276#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28277#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:06:17,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {28277#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28278#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:06:17,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {28278#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:06:17,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:06:17,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {28360#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID
[2022-04-08 10:06:17,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {28360#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {28257#false} is VALID
[2022-04-08 10:06:17,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {28257#false} assume !(~y~0 % 4294967296 > 0); {28257#false} is VALID
[2022-04-08 10:06:17,285 INFO L272 TraceCheckUtils]: 28: Hoare triple {28257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28257#false} is VALID
[2022-04-08 10:06:17,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {28257#false} ~cond := #in~cond; {28257#false} is VALID
[2022-04-08 10:06:17,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {28257#false} assume 0 == ~cond; {28257#false} is VALID
[2022-04-08 10:06:17,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {28257#false} assume !false; {28257#false} is VALID
[2022-04-08 10:06:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:06:17,286 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:17,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {28257#false} assume !false; {28257#false} is VALID
[2022-04-08 10:06:17,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {28257#false} assume 0 == ~cond; {28257#false} is VALID
[2022-04-08 10:06:17,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {28257#false} ~cond := #in~cond; {28257#false} is VALID
[2022-04-08 10:06:17,949 INFO L272 TraceCheckUtils]: 28: Hoare triple {28257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28257#false} is VALID
[2022-04-08 10:06:17,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {28257#false} assume !(~y~0 % 4294967296 > 0); {28257#false} is VALID
[2022-04-08 10:06:17,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {28394#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {28257#false} is VALID
[2022-04-08 10:06:17,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {28398#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {28394#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:06:17,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {28398#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {28398#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:06:17,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {28405#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28398#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:06:17,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {28409#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28405#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:06:17,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {28413#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28409#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:06:17,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {28417#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28413#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:06:17,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {28421#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28417#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:06:17,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {28425#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28421#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:17,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {28429#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28425#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:06:17,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {28433#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28429#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:17,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {28437#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28433#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:06:17,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {28441#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28437#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:06:17,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {28445#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28441#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:06:17,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {28449#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28445#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:06:17,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {28453#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28449#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:06:17,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {28457#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28453#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:06:17,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {28461#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28457#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:06:17,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {28465#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28461#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:06:17,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {28469#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28465#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:06:17,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {28473#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28469#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:06:17,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {28256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28473#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:06:17,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {28256#true} call #t~ret11 := main(); {28256#true} is VALID
[2022-04-08 10:06:17,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28256#true} {28256#true} #61#return; {28256#true} is VALID
[2022-04-08 10:06:17,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {28256#true} assume true; {28256#true} is VALID
[2022-04-08 10:06:17,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {28256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28256#true} is VALID
[2022-04-08 10:06:17,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {28256#true} call ULTIMATE.init(); {28256#true} is VALID
[2022-04-08 10:06:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:06:17,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277740537] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:17,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:17,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44
[2022-04-08 10:06:17,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:17,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1947833435]
[2022-04-08 10:06:17,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1947833435] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:17,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:17,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-04-08 10:06:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406274115]
[2022-04-08 10:06:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:17,963 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 10:06:17,963 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:17,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:17,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:17,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-04-08 10:06:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-04-08 10:06:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892
[2022-04-08 10:06:17,983 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:20,857 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions.
[2022-04-08 10:06:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2022-04-08 10:06:20,857 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32
[2022-04-08 10:06:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 131 transitions.
[2022-04-08 10:06:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 131 transitions.
[2022-04-08 10:06:20,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 131 transitions.
[2022-04-08 10:06:20,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:20,960 INFO L225 Difference]: With dead ends: 120
[2022-04-08 10:06:20,960 INFO L226 Difference]: Without dead ends: 114
[2022-04-08 10:06:20,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032
[2022-04-08 10:06:20,961 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 108 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:20,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 147 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-04-08 10:06:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2022-04-08 10:06:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95.
[2022-04-08 10:06:21,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:21,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:21,061 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:21,061 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:21,062 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions.
[2022-04-08 10:06:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions.
[2022-04-08 10:06:21,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:21,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:21,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states.
[2022-04-08 10:06:21,063 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states.
[2022-04-08 10:06:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:21,064 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions.
[2022-04-08 10:06:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions.
[2022-04-08 10:06:21,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:21,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:21,064 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:21,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions.
[2022-04-08 10:06:21,065 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 32
[2022-04-08 10:06:21,065 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:21,065 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions.
[2022-04-08 10:06:21,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:21,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 121 transitions.
[2022-04-08 10:06:23,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions.
[2022-04-08 10:06:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-08 10:06:23,721 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:23,721 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:23,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:23,921 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:23,921 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:23,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1621968767, now seen corresponding path program 57 times
[2022-04-08 10:06:23,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:23,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [631180536]
[2022-04-08 10:06:23,924 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:23,924 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1621968767, now seen corresponding path program 58 times
[2022-04-08 10:06:23,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:23,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170698935]
[2022-04-08 10:06:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:23,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:24,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:24,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {29211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29192#true} is VALID
[2022-04-08 10:06:24,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {29192#true} assume true; {29192#true} is VALID
[2022-04-08 10:06:24,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29192#true} {29192#true} #61#return; {29192#true} is VALID
[2022-04-08 10:06:24,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {29192#true} call ULTIMATE.init(); {29211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:24,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {29211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29192#true} is VALID
[2022-04-08 10:06:24,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {29192#true} assume true; {29192#true} is VALID
[2022-04-08 10:06:24,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29192#true} {29192#true} #61#return; {29192#true} is VALID
[2022-04-08 10:06:24,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {29192#true} call #t~ret11 := main(); {29192#true} is VALID
[2022-04-08 10:06:24,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {29192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29197#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:24,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {29197#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29198#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:24,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {29198#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29199#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:24,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {29199#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29200#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:24,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {29200#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29201#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:24,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {29201#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29202#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:24,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {29202#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29203#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:24,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {29203#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:24,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:24,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {29205#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:24,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {29205#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29206#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:06:24,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {29206#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29207#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:06:24,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {29207#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29208#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:06:24,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {29208#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29209#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {29209#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29210#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {29210#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {29193#false} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {29193#false} assume !(~y~0 % 4294967296 > 0); {29193#false} is VALID
[2022-04-08 10:06:24,138 INFO L272 TraceCheckUtils]: 29: Hoare triple {29193#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29193#false} is VALID
[2022-04-08 10:06:24,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {29193#false} ~cond := #in~cond; {29193#false} is VALID
[2022-04-08 10:06:24,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {29193#false} assume 0 == ~cond; {29193#false} is VALID
[2022-04-08 10:06:24,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {29193#false} assume !false; {29193#false} is VALID
[2022-04-08 10:06:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:06:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:24,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170698935]
[2022-04-08 10:06:24,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170698935] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:24,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284490960]
[2022-04-08 10:06:24,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:06:24,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:24,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:24,139 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:24,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process
[2022-04-08 10:06:24,180 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:06:24,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:24,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjunts are in the unsatisfiable core
[2022-04-08 10:06:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:24,189 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:24,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {29192#true} call ULTIMATE.init(); {29192#true} is VALID
[2022-04-08 10:06:24,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {29192#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29192#true} is VALID
[2022-04-08 10:06:24,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {29192#true} assume true; {29192#true} is VALID
[2022-04-08 10:06:24,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29192#true} {29192#true} #61#return; {29192#true} is VALID
[2022-04-08 10:06:24,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {29192#true} call #t~ret11 := main(); {29192#true} is VALID
[2022-04-08 10:06:24,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {29192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29197#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:24,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {29197#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29198#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:24,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {29198#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29199#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:24,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {29199#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29200#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:24,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {29200#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29201#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:24,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {29201#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29202#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:24,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {29202#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29203#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:24,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {29203#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:24,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:24,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {29257#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:24,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {29257#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29261#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:06:24,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {29261#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29265#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 10:06:24,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {29265#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29269#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:24,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {29269#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29273#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:24,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {29273#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29277#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID
[2022-04-08 10:06:24,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {29277#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {29193#false} is VALID
[2022-04-08 10:06:24,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {29193#false} assume !(~y~0 % 4294967296 > 0); {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L272 TraceCheckUtils]: 29: Hoare triple {29193#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {29193#false} ~cond := #in~cond; {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {29193#false} assume 0 == ~cond; {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {29193#false} assume !false; {29193#false} is VALID
[2022-04-08 10:06:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:06:24,446 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:24,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {29193#false} assume !false; {29193#false} is VALID
[2022-04-08 10:06:24,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {29193#false} assume 0 == ~cond; {29193#false} is VALID
[2022-04-08 10:06:24,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {29193#false} ~cond := #in~cond; {29193#false} is VALID
[2022-04-08 10:06:24,817 INFO L272 TraceCheckUtils]: 29: Hoare triple {29193#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29193#false} is VALID
[2022-04-08 10:06:24,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {29193#false} assume !(~y~0 % 4294967296 > 0); {29193#false} is VALID
[2022-04-08 10:06:24,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {29335#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID
[2022-04-08 10:06:24,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {29339#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29335#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:06:24,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {29343#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29339#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:06:24,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {29347#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29343#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:06:24,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {29351#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29347#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:06:24,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {29355#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29351#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:06:24,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {29359#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29355#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:06:24,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {29363#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29359#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:06:24,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {29367#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29363#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:06:24,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {29371#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29367#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:06:24,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {29375#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29371#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:06:24,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {29379#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29375#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:06:24,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {29192#true} ~z~0 := ~y~0; {29379#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:06:24,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {29192#true} assume !(~x~0 % 4294967296 > 0); {29192#true} is VALID
[2022-04-08 10:06:24,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {29192#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29192#true} is VALID
[2022-04-08 10:06:24,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {29192#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29192#true} is VALID
[2022-04-08 10:06:24,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {29192#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {29192#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {29192#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {29192#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {29192#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {29192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {29192#true} call #t~ret11 := main(); {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29192#true} {29192#true} #61#return; {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {29192#true} assume true; {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {29192#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {29192#true} call ULTIMATE.init(); {29192#true} is VALID
[2022-04-08 10:06:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2022-04-08 10:06:24,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284490960] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:24,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:24,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 35
[2022-04-08 10:06:24,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:24,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [631180536]
[2022-04-08 10:06:24,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [631180536] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:24,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:24,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-04-08 10:06:24,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249832611]
[2022-04-08 10:06:24,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:24,830 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 10:06:24,830 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:24,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:24,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:24,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-04-08 10:06:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:24,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-04-08 10:06:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190
[2022-04-08 10:06:24,856 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:25,765 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions.
[2022-04-08 10:06:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-04-08 10:06:25,765 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 10:06:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions.
[2022-04-08 10:06:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions.
[2022-04-08 10:06:25,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 51 transitions.
[2022-04-08 10:06:25,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:25,805 INFO L225 Difference]: With dead ends: 118
[2022-04-08 10:06:25,805 INFO L226 Difference]: Without dead ends: 105
[2022-04-08 10:06:25,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=2060, Unknown=0, NotChecked=0, Total=2352
[2022-04-08 10:06:25,806 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:25,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:06:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2022-04-08 10:06:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96.
[2022-04-08 10:06:25,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:25,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:25,904 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:25,904 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:25,905 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions.
[2022-04-08 10:06:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions.
[2022-04-08 10:06:25,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:25,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:25,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states.
[2022-04-08 10:06:25,906 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states.
[2022-04-08 10:06:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:25,907 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions.
[2022-04-08 10:06:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions.
[2022-04-08 10:06:25,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:25,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:25,907 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:25,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions.
[2022-04-08 10:06:25,909 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 33
[2022-04-08 10:06:25,909 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:25,909 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions.
[2022-04-08 10:06:25,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:25,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 122 transitions.
[2022-04-08 10:06:30,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 121 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions.
[2022-04-08 10:06:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-08 10:06:30,987 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:30,987 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:31,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:31,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47
[2022-04-08 10:06:31,188 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash -843221009, now seen corresponding path program 59 times
[2022-04-08 10:06:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:31,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1536605342]
[2022-04-08 10:06:31,190 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:31,190 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash -843221009, now seen corresponding path program 60 times
[2022-04-08 10:06:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:31,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621212957]
[2022-04-08 10:06:31,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:31,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:31,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:31,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {30111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30093#true} is VALID
[2022-04-08 10:06:31,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {30093#true} assume true; {30093#true} is VALID
[2022-04-08 10:06:31,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30093#true} {30093#true} #61#return; {30093#true} is VALID
[2022-04-08 10:06:31,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {30093#true} call ULTIMATE.init(); {30111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:31,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {30111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30093#true} is VALID
[2022-04-08 10:06:31,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {30093#true} assume true; {30093#true} is VALID
[2022-04-08 10:06:31,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30093#true} {30093#true} #61#return; {30093#true} is VALID
[2022-04-08 10:06:31,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {30093#true} call #t~ret11 := main(); {30093#true} is VALID
[2022-04-08 10:06:31,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {30093#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30098#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:31,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {30098#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30099#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:31,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {30099#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30100#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:31,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {30100#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30101#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:31,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {30101#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30102#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:31,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {30102#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30103#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:31,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {30103#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30104#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:31,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {30104#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30105#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:31,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {30105#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:31,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:31,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {30107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:06:31,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {30107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:31,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {30108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:06:31,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {30109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30110#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:06:31,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {30110#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {30094#false} is VALID
[2022-04-08 10:06:31,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {30094#false} assume !(~y~0 % 4294967296 > 0); {30094#false} is VALID
[2022-04-08 10:06:31,408 INFO L272 TraceCheckUtils]: 29: Hoare triple {30094#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30094#false} is VALID
[2022-04-08 10:06:31,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {30094#false} ~cond := #in~cond; {30094#false} is VALID
[2022-04-08 10:06:31,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {30094#false} assume 0 == ~cond; {30094#false} is VALID
[2022-04-08 10:06:31,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {30094#false} assume !false; {30094#false} is VALID
[2022-04-08 10:06:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:06:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621212957]
[2022-04-08 10:06:31,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621212957] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676107095]
[2022-04-08 10:06:31,408 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:06:31,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:31,411 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:31,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process
[2022-04-08 10:06:31,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-08 10:06:31,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:31,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 27 conjunts are in the unsatisfiable core
[2022-04-08 10:06:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:31,500 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:31,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {30093#true} call ULTIMATE.init(); {30093#true} is VALID
[2022-04-08 10:06:31,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {30093#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30093#true} is VALID
[2022-04-08 10:06:31,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {30093#true} assume true; {30093#true} is VALID
[2022-04-08 10:06:31,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30093#true} {30093#true} #61#return; {30093#true} is VALID
[2022-04-08 10:06:31,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {30093#true} call #t~ret11 := main(); {30093#true} is VALID
[2022-04-08 10:06:31,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {30093#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30098#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:31,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {30098#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30099#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:31,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {30099#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30100#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:31,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {30100#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30101#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:31,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {30101#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30102#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:31,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {30102#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30103#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:31,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {30103#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30104#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:31,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {30104#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30105#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:31,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {30105#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:31,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:31,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {30107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:06:31,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {30107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:31,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {30108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:06:31,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {30109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30169#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:06:31,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {30169#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30094#false} is VALID
[2022-04-08 10:06:31,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:31,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {30094#false} assume !(~y~0 % 4294967296 > 0); {30094#false} is VALID
[2022-04-08 10:06:31,734 INFO L272 TraceCheckUtils]: 29: Hoare triple {30094#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30094#false} is VALID
[2022-04-08 10:06:31,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {30094#false} ~cond := #in~cond; {30094#false} is VALID
[2022-04-08 10:06:31,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {30094#false} assume 0 == ~cond; {30094#false} is VALID
[2022-04-08 10:06:31,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {30094#false} assume !false; {30094#false} is VALID
[2022-04-08 10:06:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:06:31,734 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:32,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {30094#false} assume !false; {30094#false} is VALID
[2022-04-08 10:06:32,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {30094#false} assume 0 == ~cond; {30094#false} is VALID
[2022-04-08 10:06:32,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {30094#false} ~cond := #in~cond; {30094#false} is VALID
[2022-04-08 10:06:32,075 INFO L272 TraceCheckUtils]: 29: Hoare triple {30094#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30094#false} is VALID
[2022-04-08 10:06:32,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {30094#false} assume !(~y~0 % 4294967296 > 0); {30094#false} is VALID
[2022-04-08 10:06:32,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:32,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:32,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:32,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:32,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:32,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:32,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:32,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID
[2022-04-08 10:06:32,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {30251#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30094#false} is VALID
[2022-04-08 10:06:32,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {30255#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30251#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:06:32,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {30259#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30255#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:32,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {30263#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30259#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:32,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {30267#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {30263#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:06:32,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {30267#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30267#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:06:32,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {30274#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30267#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:06:32,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {30278#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30274#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:32,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {30282#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30278#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:32,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {30286#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30282#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:06:32,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {30290#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30286#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:06:32,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {30294#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30290#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:06:32,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {30298#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30294#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:06:32,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {30302#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30298#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:06:32,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {30093#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30302#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:32,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {30093#true} call #t~ret11 := main(); {30093#true} is VALID
[2022-04-08 10:06:32,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30093#true} {30093#true} #61#return; {30093#true} is VALID
[2022-04-08 10:06:32,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {30093#true} assume true; {30093#true} is VALID
[2022-04-08 10:06:32,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {30093#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30093#true} is VALID
[2022-04-08 10:06:32,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {30093#true} call ULTIMATE.init(); {30093#true} is VALID
[2022-04-08 10:06:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:06:32,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676107095] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:32,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:32,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30
[2022-04-08 10:06:32,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:32,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1536605342]
[2022-04-08 10:06:32,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1536605342] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:32,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:32,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-04-08 10:06:32,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547934617]
[2022-04-08 10:06:32,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:32,088 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 10:06:32,088 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:32,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:32,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:32,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-04-08 10:06:32,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-04-08 10:06:32,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870
[2022-04-08 10:06:32,104 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:33,104 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions.
[2022-04-08 10:06:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2022-04-08 10:06:33,104 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 10:06:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions.
[2022-04-08 10:06:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions.
[2022-04-08 10:06:33,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 58 transitions.
[2022-04-08 10:06:33,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:33,150 INFO L225 Difference]: With dead ends: 121
[2022-04-08 10:06:33,150 INFO L226 Difference]: Without dead ends: 107
[2022-04-08 10:06:33,150 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=414, Invalid=1656, Unknown=0, NotChecked=0, Total=2070
[2022-04-08 10:06:33,151 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:33,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 75 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:06:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2022-04-08 10:06:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97.
[2022-04-08 10:06:33,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:33,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:33,247 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:33,247 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:33,248 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions.
[2022-04-08 10:06:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions.
[2022-04-08 10:06:33,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:33,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:33,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states.
[2022-04-08 10:06:33,248 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states.
[2022-04-08 10:06:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:33,249 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions.
[2022-04-08 10:06:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions.
[2022-04-08 10:06:33,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:33,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:33,250 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:33,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions.
[2022-04-08 10:06:33,251 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 33
[2022-04-08 10:06:33,251 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:33,251 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions.
[2022-04-08 10:06:33,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:33,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 123 transitions.
[2022-04-08 10:06:35,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions.
[2022-04-08 10:06:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-08 10:06:35,575 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:35,575 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:35,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:35,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48
[2022-04-08 10:06:35,775 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:35,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1137014465, now seen corresponding path program 61 times
[2022-04-08 10:06:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:35,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1556089266]
[2022-04-08 10:06:35,778 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:35,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1137014465, now seen corresponding path program 62 times
[2022-04-08 10:06:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:35,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106109954]
[2022-04-08 10:06:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:35,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:35,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {31022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31005#true} is VALID
[2022-04-08 10:06:35,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {31005#true} assume true; {31005#true} is VALID
[2022-04-08 10:06:35,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31005#true} {31005#true} #61#return; {31005#true} is VALID
[2022-04-08 10:06:35,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {31005#true} call ULTIMATE.init(); {31022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:35,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {31022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31005#true} is VALID
[2022-04-08 10:06:35,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {31005#true} assume true; {31005#true} is VALID
[2022-04-08 10:06:35,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31005#true} {31005#true} #61#return; {31005#true} is VALID
[2022-04-08 10:06:35,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {31005#true} call #t~ret11 := main(); {31005#true} is VALID
[2022-04-08 10:06:35,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {31005#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31010#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:35,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {31010#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31011#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:35,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {31011#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31012#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:35,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {31012#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31013#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:35,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {31013#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31014#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:35,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {31014#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31015#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:35,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {31015#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31016#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:35,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {31016#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31017#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:35,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {31017#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31018#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:35,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {31018#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:35,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:35,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {31020#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:06:35,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {31020#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31021#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:06:35,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {31021#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {31006#false} is VALID
[2022-04-08 10:06:35,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:35,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:35,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:35,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {31006#false} assume !(~y~0 % 4294967296 > 0); {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L272 TraceCheckUtils]: 29: Hoare triple {31006#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {31006#false} ~cond := #in~cond; {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {31006#false} assume 0 == ~cond; {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {31006#false} assume !false; {31006#false} is VALID
[2022-04-08 10:06:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:06:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:35,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106109954]
[2022-04-08 10:06:35,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106109954] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:35,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220476437]
[2022-04-08 10:06:35,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:06:35,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:35,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:35,975 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:35,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process
[2022-04-08 10:06:36,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:06:36,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:36,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 25 conjunts are in the unsatisfiable core
[2022-04-08 10:06:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:36,021 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:36,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {31005#true} call ULTIMATE.init(); {31005#true} is VALID
[2022-04-08 10:06:36,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {31005#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31005#true} is VALID
[2022-04-08 10:06:36,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {31005#true} assume true; {31005#true} is VALID
[2022-04-08 10:06:36,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31005#true} {31005#true} #61#return; {31005#true} is VALID
[2022-04-08 10:06:36,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {31005#true} call #t~ret11 := main(); {31005#true} is VALID
[2022-04-08 10:06:36,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {31005#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31010#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:36,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {31010#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31011#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:36,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {31011#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31012#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:36,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {31012#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31013#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:36,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {31013#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31014#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:36,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {31014#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31015#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:36,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {31015#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31016#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:36,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {31016#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31017#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:36,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {31017#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31018#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:36,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {31018#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:36,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:36,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {31020#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:06:36,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {31020#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:06:36,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {31006#false} is VALID
[2022-04-08 10:06:36,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {31006#false} assume !(~y~0 % 4294967296 > 0); {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L272 TraceCheckUtils]: 29: Hoare triple {31006#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {31006#false} ~cond := #in~cond; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {31006#false} assume 0 == ~cond; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {31006#false} assume !false; {31006#false} is VALID
[2022-04-08 10:06:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:06:36,254 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:36,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {31006#false} assume !false; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {31006#false} assume 0 == ~cond; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {31006#false} ~cond := #in~cond; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L272 TraceCheckUtils]: 29: Hoare triple {31006#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {31006#false} assume !(~y~0 % 4294967296 > 0); {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID
[2022-04-08 10:06:36,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {31165#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31006#false} is VALID
[2022-04-08 10:06:36,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {31169#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31165#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:06:36,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {31173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {31169#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:36,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {31173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {31173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:36,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {31180#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:36,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {31184#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31180#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:06:36,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {31188#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31184#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:06:36,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {31192#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31188#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:06:36,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {31196#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31192#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:06:36,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {31200#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31196#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:06:36,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {31204#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31200#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:36,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {31208#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31204#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:06:36,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {31212#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31208#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:36,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {31005#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31212#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:06:36,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {31005#true} call #t~ret11 := main(); {31005#true} is VALID
[2022-04-08 10:06:36,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31005#true} {31005#true} #61#return; {31005#true} is VALID
[2022-04-08 10:06:36,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {31005#true} assume true; {31005#true} is VALID
[2022-04-08 10:06:36,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {31005#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31005#true} is VALID
[2022-04-08 10:06:36,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {31005#true} call ULTIMATE.init(); {31005#true} is VALID
[2022-04-08 10:06:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:06:36,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220476437] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:36,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:36,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28
[2022-04-08 10:06:36,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:36,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1556089266]
[2022-04-08 10:06:36,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1556089266] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:36,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:36,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-04-08 10:06:36,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001693363]
[2022-04-08 10:06:36,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:36,559 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 10:06:36,559 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:36,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:36,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:36,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-04-08 10:06:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:36,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-04-08 10:06:36,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756
[2022-04-08 10:06:36,578 INFO L87 Difference]: Start difference. First operand 97 states and 123 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:37,487 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions.
[2022-04-08 10:06:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-04-08 10:06:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 10:06:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions.
[2022-04-08 10:06:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions.
[2022-04-08 10:06:37,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 60 transitions.
[2022-04-08 10:06:37,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:37,540 INFO L225 Difference]: With dead ends: 124
[2022-04-08 10:06:37,540 INFO L226 Difference]: Without dead ends: 109
[2022-04-08 10:06:37,541 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640
[2022-04-08 10:06:37,541 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:37,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 76 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:06:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2022-04-08 10:06:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98.
[2022-04-08 10:06:37,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:37,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:37,649 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:37,649 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:37,650 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions.
[2022-04-08 10:06:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions.
[2022-04-08 10:06:37,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:37,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:37,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states.
[2022-04-08 10:06:37,651 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states.
[2022-04-08 10:06:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:37,652 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions.
[2022-04-08 10:06:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions.
[2022-04-08 10:06:37,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:37,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:37,652 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:37,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions.
[2022-04-08 10:06:37,653 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 33
[2022-04-08 10:06:37,653 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:37,653 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions.
[2022-04-08 10:06:37,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:37,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 124 transitions.
[2022-04-08 10:06:43,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 123 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions.
[2022-04-08 10:06:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-08 10:06:43,542 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:43,542 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:43,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:43,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49
[2022-04-08 10:06:43,759 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:43,759 INFO L85 PathProgramCache]: Analyzing trace with hash -396490866, now seen corresponding path program 37 times
[2022-04-08 10:06:43,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:43,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99907518]
[2022-04-08 10:06:43,761 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:43,761 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash -396490866, now seen corresponding path program 38 times
[2022-04-08 10:06:43,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:43,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007644606]
[2022-04-08 10:06:43,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:43,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:44,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {31947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31921#true} is VALID
[2022-04-08 10:06:44,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {31921#true} assume true; {31921#true} is VALID
[2022-04-08 10:06:44,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31921#true} {31921#true} #61#return; {31921#true} is VALID
[2022-04-08 10:06:44,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {31921#true} call ULTIMATE.init(); {31947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:44,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {31947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31921#true} is VALID
[2022-04-08 10:06:44,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {31921#true} assume true; {31921#true} is VALID
[2022-04-08 10:06:44,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31921#true} {31921#true} #61#return; {31921#true} is VALID
[2022-04-08 10:06:44,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {31921#true} call #t~ret11 := main(); {31921#true} is VALID
[2022-04-08 10:06:44,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {31921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31926#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:44,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {31926#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:44,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {31927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:44,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {31928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:44,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {31929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:44,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {31930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:44,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {31931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:44,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {31932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:44,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {31933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:44,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {31934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:44,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {31935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:06:44,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {31936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31937#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:06:44,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {31937#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31938#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:06:44,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {31938#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31939#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:06:44,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {31939#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31940#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:06:44,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {31940#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31941#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:06:44,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {31941#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31942#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:06:44,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {31942#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31943#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:06:44,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {31943#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31944#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:06:44,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {31944#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:06:44,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:06:44,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {31946#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:06:44,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {31946#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {31922#false} is VALID
[2022-04-08 10:06:44,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {31922#false} assume !(~y~0 % 4294967296 > 0); {31922#false} is VALID
[2022-04-08 10:06:44,154 INFO L272 TraceCheckUtils]: 29: Hoare triple {31922#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31922#false} is VALID
[2022-04-08 10:06:44,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {31922#false} ~cond := #in~cond; {31922#false} is VALID
[2022-04-08 10:06:44,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {31922#false} assume 0 == ~cond; {31922#false} is VALID
[2022-04-08 10:06:44,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {31922#false} assume !false; {31922#false} is VALID
[2022-04-08 10:06:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:06:44,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:44,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007644606]
[2022-04-08 10:06:44,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007644606] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:44,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391457862]
[2022-04-08 10:06:44,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:06:44,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:44,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:44,161 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:44,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process
[2022-04-08 10:06:44,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:06:44,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:44,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core
[2022-04-08 10:06:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:44,220 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:44,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {31921#true} call ULTIMATE.init(); {31921#true} is VALID
[2022-04-08 10:06:44,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {31921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31921#true} is VALID
[2022-04-08 10:06:44,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {31921#true} assume true; {31921#true} is VALID
[2022-04-08 10:06:44,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31921#true} {31921#true} #61#return; {31921#true} is VALID
[2022-04-08 10:06:44,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {31921#true} call #t~ret11 := main(); {31921#true} is VALID
[2022-04-08 10:06:44,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {31921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31926#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:44,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {31926#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:44,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {31927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:44,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {31928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:44,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {31929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:44,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {31930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:44,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {31931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:44,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {31932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:44,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {31933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:44,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {31934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:44,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {31935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:06:44,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {31936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31937#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:06:44,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {31937#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31938#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:06:44,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {31938#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31939#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:06:44,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {31939#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31940#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:06:44,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {31940#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31941#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:06:44,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {31941#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31942#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:06:44,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {31942#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31943#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:06:44,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {31943#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31944#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:06:44,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {31944#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:06:44,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:06:44,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {32029#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID
[2022-04-08 10:06:44,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {32029#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {31922#false} is VALID
[2022-04-08 10:06:44,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {31922#false} assume !(~y~0 % 4294967296 > 0); {31922#false} is VALID
[2022-04-08 10:06:44,533 INFO L272 TraceCheckUtils]: 29: Hoare triple {31922#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31922#false} is VALID
[2022-04-08 10:06:44,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {31922#false} ~cond := #in~cond; {31922#false} is VALID
[2022-04-08 10:06:44,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {31922#false} assume 0 == ~cond; {31922#false} is VALID
[2022-04-08 10:06:44,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {31922#false} assume !false; {31922#false} is VALID
[2022-04-08 10:06:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:06:44,533 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:45,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {31922#false} assume !false; {31922#false} is VALID
[2022-04-08 10:06:45,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {31922#false} assume 0 == ~cond; {31922#false} is VALID
[2022-04-08 10:06:45,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {31922#false} ~cond := #in~cond; {31922#false} is VALID
[2022-04-08 10:06:45,267 INFO L272 TraceCheckUtils]: 29: Hoare triple {31922#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31922#false} is VALID
[2022-04-08 10:06:45,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {31922#false} assume !(~y~0 % 4294967296 > 0); {31922#false} is VALID
[2022-04-08 10:06:45,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {32063#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31922#false} is VALID
[2022-04-08 10:06:45,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {32067#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {32063#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:06:45,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {32067#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {32067#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:06:45,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {32074#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32067#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:06:45,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {32078#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32074#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:06:45,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {32082#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32078#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:06:45,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {32086#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32082#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:06:45,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {32090#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32086#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:06:45,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {32094#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32090#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:45,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {32098#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32094#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:06:45,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {32102#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32098#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:45,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {32106#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32102#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:06:45,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {32110#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32106#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:06:45,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {32114#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32110#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:06:45,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {32118#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32114#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:06:45,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {32122#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32118#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:06:45,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {32126#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32122#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:06:45,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {32130#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32126#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:06:45,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {32134#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32130#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:06:45,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {32138#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32134#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:06:45,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {32142#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32138#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:06:45,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {32146#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32142#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:06:45,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {31921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32146#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:45,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {31921#true} call #t~ret11 := main(); {31921#true} is VALID
[2022-04-08 10:06:45,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31921#true} {31921#true} #61#return; {31921#true} is VALID
[2022-04-08 10:06:45,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {31921#true} assume true; {31921#true} is VALID
[2022-04-08 10:06:45,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {31921#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31921#true} is VALID
[2022-04-08 10:06:45,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {31921#true} call ULTIMATE.init(); {31921#true} is VALID
[2022-04-08 10:06:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:06:45,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391457862] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:45,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:45,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46
[2022-04-08 10:06:45,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:45,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99907518]
[2022-04-08 10:06:45,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99907518] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:45,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:45,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2022-04-08 10:06:45,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065809886]
[2022-04-08 10:06:45,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:45,283 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 10:06:45,283 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:45,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:45,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:45,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2022-04-08 10:06:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2022-04-08 10:06:45,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070
[2022-04-08 10:06:45,302 INFO L87 Difference]: Start difference. First operand 98 states and 124 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:48,513 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions.
[2022-04-08 10:06:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2022-04-08 10:06:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33
[2022-04-08 10:06:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions.
[2022-04-08 10:06:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions.
[2022-04-08 10:06:48,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 138 transitions.
[2022-04-08 10:06:48,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:48,620 INFO L225 Difference]: With dead ends: 129
[2022-04-08 10:06:48,620 INFO L226 Difference]: Without dead ends: 123
[2022-04-08 10:06:48,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422
[2022-04-08 10:06:48,621 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 116 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:48,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 155 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2000 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-04-08 10:06:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2022-04-08 10:06:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 103.
[2022-04-08 10:06:48,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:48,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:48,737 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:48,737 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:48,738 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions.
[2022-04-08 10:06:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions.
[2022-04-08 10:06:48,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:48,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:48,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states.
[2022-04-08 10:06:48,738 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states.
[2022-04-08 10:06:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:48,739 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions.
[2022-04-08 10:06:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions.
[2022-04-08 10:06:48,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:48,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:48,740 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:48,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions.
[2022-04-08 10:06:48,741 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 33
[2022-04-08 10:06:48,741 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:48,741 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions.
[2022-04-08 10:06:48,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:48,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 131 transitions.
[2022-04-08 10:06:49,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions.
[2022-04-08 10:06:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-08 10:06:49,840 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:49,841 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:49,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:50,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50
[2022-04-08 10:06:50,056 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1579041151, now seen corresponding path program 63 times
[2022-04-08 10:06:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:50,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [636656242]
[2022-04-08 10:06:50,058 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:50,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1579041151, now seen corresponding path program 64 times
[2022-04-08 10:06:50,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:50,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916605764]
[2022-04-08 10:06:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:50,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:50,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {32939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32919#true} is VALID
[2022-04-08 10:06:50,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {32919#true} assume true; {32919#true} is VALID
[2022-04-08 10:06:50,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32919#true} {32919#true} #61#return; {32919#true} is VALID
[2022-04-08 10:06:50,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {32919#true} call ULTIMATE.init(); {32939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:50,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {32939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32919#true} is VALID
[2022-04-08 10:06:50,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {32919#true} assume true; {32919#true} is VALID
[2022-04-08 10:06:50,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32919#true} {32919#true} #61#return; {32919#true} is VALID
[2022-04-08 10:06:50,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {32919#true} call #t~ret11 := main(); {32919#true} is VALID
[2022-04-08 10:06:50,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {32919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32924#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:50,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {32924#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32925#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:50,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {32925#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:50,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {32926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32927#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:50,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {32927#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32928#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:50,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {32928#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32929#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:50,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {32929#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32930#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:50,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {32930#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:50,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:50,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {32932#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:50,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {32932#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32933#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:06:50,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {32933#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32934#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:06:50,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {32934#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32935#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:06:50,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {32935#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32936#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:06:50,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {32936#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32937#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:06:50,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {32937#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32938#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:06:50,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {32938#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32920#false} is VALID
[2022-04-08 10:06:50,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {32920#false} assume !(~y~0 % 4294967296 > 0); {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L272 TraceCheckUtils]: 30: Hoare triple {32920#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {32920#false} ~cond := #in~cond; {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {32920#false} assume 0 == ~cond; {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {32920#false} assume !false; {32920#false} is VALID
[2022-04-08 10:06:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:06:50,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:50,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916605764]
[2022-04-08 10:06:50,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916605764] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354160855]
[2022-04-08 10:06:50,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:06:50,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:50,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:50,386 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:50,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process
[2022-04-08 10:06:50,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:06:50,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:50,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 44 conjunts are in the unsatisfiable core
[2022-04-08 10:06:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:50,434 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:50,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {32919#true} call ULTIMATE.init(); {32919#true} is VALID
[2022-04-08 10:06:50,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {32919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32919#true} is VALID
[2022-04-08 10:06:50,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {32919#true} assume true; {32919#true} is VALID
[2022-04-08 10:06:50,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32919#true} {32919#true} #61#return; {32919#true} is VALID
[2022-04-08 10:06:50,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {32919#true} call #t~ret11 := main(); {32919#true} is VALID
[2022-04-08 10:06:50,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {32919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32924#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:50,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {32924#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32925#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:50,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {32925#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:50,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {32926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32927#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:50,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {32927#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32928#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:50,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {32928#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32929#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:50,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {32929#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32930#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:50,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {32930#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:50,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:50,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {32985#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:50,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {32985#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32989#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:06:50,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {32989#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32993#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID
[2022-04-08 10:06:50,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {32993#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32997#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:50,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {32997#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33001#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID
[2022-04-08 10:06:50,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {33001#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33005#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:50,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {33005#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33009#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:50,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {33009#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~z~0 % 4294967296 > 0); {32920#false} is VALID
[2022-04-08 10:06:50,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:50,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {32920#false} assume !(~y~0 % 4294967296 > 0); {32920#false} is VALID
[2022-04-08 10:06:50,760 INFO L272 TraceCheckUtils]: 30: Hoare triple {32920#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32920#false} is VALID
[2022-04-08 10:06:50,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {32920#false} ~cond := #in~cond; {32920#false} is VALID
[2022-04-08 10:06:50,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {32920#false} assume 0 == ~cond; {32920#false} is VALID
[2022-04-08 10:06:50,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {32920#false} assume !false; {32920#false} is VALID
[2022-04-08 10:06:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:06:50,761 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:51,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {32920#false} assume !false; {32920#false} is VALID
[2022-04-08 10:06:51,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {32920#false} assume 0 == ~cond; {32920#false} is VALID
[2022-04-08 10:06:51,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {32920#false} ~cond := #in~cond; {32920#false} is VALID
[2022-04-08 10:06:51,250 INFO L272 TraceCheckUtils]: 30: Hoare triple {32920#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32920#false} is VALID
[2022-04-08 10:06:51,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {32920#false} assume !(~y~0 % 4294967296 > 0); {32920#false} is VALID
[2022-04-08 10:06:51,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {33064#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID
[2022-04-08 10:06:51,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {33068#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33064#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:06:51,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {33072#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33068#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:06:51,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {33076#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33072#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:06:51,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {33080#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33076#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:06:51,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {33084#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33080#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:06:51,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {33088#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33084#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:06:51,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {33092#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {33088#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:06:51,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {33096#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33092#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:51,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {33100#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33096#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:51,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {33104#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33100#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:51,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {33108#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33104#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:51,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {33112#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33108#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:51,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {33116#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33112#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {32919#true} ~z~0 := ~y~0; {33116#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {32919#true} assume !(~x~0 % 4294967296 > 0); {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {32919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {32919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {32919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {32919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {32919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {32919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {32919#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {32919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {32919#true} call #t~ret11 := main(); {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32919#true} {32919#true} #61#return; {32919#true} is VALID
[2022-04-08 10:06:51,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {32919#true} assume true; {32919#true} is VALID
[2022-04-08 10:06:51,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {32919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32919#true} is VALID
[2022-04-08 10:06:51,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {32919#true} call ULTIMATE.init(); {32919#true} is VALID
[2022-04-08 10:06:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-08 10:06:51,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354160855] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:51,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:51,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 39
[2022-04-08 10:06:51,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:51,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [636656242]
[2022-04-08 10:06:51,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [636656242] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:51,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:51,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-04-08 10:06:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149136058]
[2022-04-08 10:06:51,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 10:06:51,265 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:51,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:51,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:51,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-04-08 10:06:51,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:51,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-04-08 10:06:51,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482
[2022-04-08 10:06:51,286 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:52,398 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions.
[2022-04-08 10:06:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2022-04-08 10:06:52,398 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 10:06:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions.
[2022-04-08 10:06:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions.
[2022-04-08 10:06:52,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 52 transitions.
[2022-04-08 10:06:52,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:52,438 INFO L225 Difference]: With dead ends: 126
[2022-04-08 10:06:52,438 INFO L226 Difference]: Without dead ends: 113
[2022-04-08 10:06:52,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862
[2022-04-08 10:06:52,439 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:52,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:06:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2022-04-08 10:06:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104.
[2022-04-08 10:06:52,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:52,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:52,544 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:52,545 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:52,545 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions.
[2022-04-08 10:06:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions.
[2022-04-08 10:06:52,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:52,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:52,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states.
[2022-04-08 10:06:52,546 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states.
[2022-04-08 10:06:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:52,547 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions.
[2022-04-08 10:06:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions.
[2022-04-08 10:06:52,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:52,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:52,547 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:52,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions.
[2022-04-08 10:06:52,548 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 34
[2022-04-08 10:06:52,548 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:52,548 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions.
[2022-04-08 10:06:52,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:52,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 132 transitions.
[2022-04-08 10:06:53,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions.
[2022-04-08 10:06:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-08 10:06:53,701 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:53,701 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:53,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:53,901 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:53,901 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:53,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash 661878733, now seen corresponding path program 65 times
[2022-04-08 10:06:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:53,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080373897]
[2022-04-08 10:06:53,904 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:53,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 661878733, now seen corresponding path program 66 times
[2022-04-08 10:06:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:53,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144920778]
[2022-04-08 10:06:53,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:54,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {33899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33880#true} is VALID
[2022-04-08 10:06:54,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {33880#true} assume true; {33880#true} is VALID
[2022-04-08 10:06:54,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33880#true} {33880#true} #61#return; {33880#true} is VALID
[2022-04-08 10:06:54,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {33880#true} call ULTIMATE.init(); {33899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:54,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {33899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33880#true} is VALID
[2022-04-08 10:06:54,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {33880#true} assume true; {33880#true} is VALID
[2022-04-08 10:06:54,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33880#true} {33880#true} #61#return; {33880#true} is VALID
[2022-04-08 10:06:54,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {33880#true} call #t~ret11 := main(); {33880#true} is VALID
[2022-04-08 10:06:54,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {33880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33885#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:54,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {33885#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:54,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {33886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:54,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {33887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:54,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {33888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:54,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {33889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:54,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {33890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:54,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {33891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:54,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {33892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:54,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:54,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {33894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:06:54,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {33894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:54,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {33895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33896#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:06:54,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {33896#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33897#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:06:54,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {33897#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33898#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:06:54,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {33898#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {33881#false} is VALID
[2022-04-08 10:06:54,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {33881#false} assume !(~y~0 % 4294967296 > 0); {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L272 TraceCheckUtils]: 30: Hoare triple {33881#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {33881#false} ~cond := #in~cond; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {33881#false} assume 0 == ~cond; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {33881#false} assume !false; {33881#false} is VALID
[2022-04-08 10:06:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:06:54,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:54,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144920778]
[2022-04-08 10:06:54,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144920778] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:54,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461400250]
[2022-04-08 10:06:54,162 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:06:54,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:54,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:54,163 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:54,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process
[2022-04-08 10:06:54,267 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-08 10:06:54,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:54,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core
[2022-04-08 10:06:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:54,276 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:54,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {33880#true} call ULTIMATE.init(); {33880#true} is VALID
[2022-04-08 10:06:54,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {33880#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33880#true} is VALID
[2022-04-08 10:06:54,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {33880#true} assume true; {33880#true} is VALID
[2022-04-08 10:06:54,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33880#true} {33880#true} #61#return; {33880#true} is VALID
[2022-04-08 10:06:54,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {33880#true} call #t~ret11 := main(); {33880#true} is VALID
[2022-04-08 10:06:54,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {33880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33885#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:54,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {33885#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:54,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {33886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:54,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {33887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:54,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {33888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:54,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {33889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:54,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {33890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:54,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {33891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:54,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {33892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:54,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:54,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {33894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:06:54,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {33894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:54,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {33895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33896#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:06:54,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {33896#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33897#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:06:54,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {33897#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33960#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:06:54,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {33960#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {33881#false} is VALID
[2022-04-08 10:06:54,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {33881#false} assume !(~y~0 % 4294967296 > 0); {33881#false} is VALID
[2022-04-08 10:06:54,520 INFO L272 TraceCheckUtils]: 30: Hoare triple {33881#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33881#false} is VALID
[2022-04-08 10:06:54,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {33881#false} ~cond := #in~cond; {33881#false} is VALID
[2022-04-08 10:06:54,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {33881#false} assume 0 == ~cond; {33881#false} is VALID
[2022-04-08 10:06:54,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {33881#false} assume !false; {33881#false} is VALID
[2022-04-08 10:06:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:06:54,520 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:54,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {33881#false} assume !false; {33881#false} is VALID
[2022-04-08 10:06:54,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {33881#false} assume 0 == ~cond; {33881#false} is VALID
[2022-04-08 10:06:54,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {33881#false} ~cond := #in~cond; {33881#false} is VALID
[2022-04-08 10:06:54,875 INFO L272 TraceCheckUtils]: 30: Hoare triple {33881#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33881#false} is VALID
[2022-04-08 10:06:54,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {33881#false} assume !(~y~0 % 4294967296 > 0); {33881#false} is VALID
[2022-04-08 10:06:54,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID
[2022-04-08 10:06:54,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {34042#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33881#false} is VALID
[2022-04-08 10:06:54,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {34046#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34042#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:06:54,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {34050#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34046#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:54,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {34054#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34050#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:54,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {34058#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34054#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:06:54,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {34062#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {34058#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:06:54,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {34062#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {34062#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:54,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {34069#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34062#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:54,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {34073#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34069#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:06:54,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {34077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34073#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:54,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {34081#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:54,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {34085#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34081#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:06:54,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {34089#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34085#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:06:54,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {34093#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34089#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:06:54,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {34097#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34093#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:06:54,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {33880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34097#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:06:54,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {33880#true} call #t~ret11 := main(); {33880#true} is VALID
[2022-04-08 10:06:54,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33880#true} {33880#true} #61#return; {33880#true} is VALID
[2022-04-08 10:06:54,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {33880#true} assume true; {33880#true} is VALID
[2022-04-08 10:06:54,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {33880#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33880#true} is VALID
[2022-04-08 10:06:54,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {33880#true} call ULTIMATE.init(); {33880#true} is VALID
[2022-04-08 10:06:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:06:54,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461400250] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:54,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:54,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32
[2022-04-08 10:06:54,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:54,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1080373897]
[2022-04-08 10:06:54,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1080373897] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:54,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:54,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-04-08 10:06:54,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741871737]
[2022-04-08 10:06:54,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 10:06:54,887 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:54,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:54,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:54,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-04-08 10:06:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:54,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-04-08 10:06:54,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992
[2022-04-08 10:06:54,904 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:55,986 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions.
[2022-04-08 10:06:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2022-04-08 10:06:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 10:06:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions.
[2022-04-08 10:06:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions.
[2022-04-08 10:06:55,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 60 transitions.
[2022-04-08 10:06:56,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:56,034 INFO L225 Difference]: With dead ends: 129
[2022-04-08 10:06:56,034 INFO L226 Difference]: Without dead ends: 115
[2022-04-08 10:06:56,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=474, Invalid=1976, Unknown=0, NotChecked=0, Total=2450
[2022-04-08 10:06:56,035 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:56,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 75 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:06:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2022-04-08 10:06:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105.
[2022-04-08 10:06:56,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:56,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:56,149 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:56,150 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:56,151 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions.
[2022-04-08 10:06:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions.
[2022-04-08 10:06:56,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:56,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:56,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states.
[2022-04-08 10:06:56,151 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states.
[2022-04-08 10:06:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:56,152 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions.
[2022-04-08 10:06:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions.
[2022-04-08 10:06:56,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:56,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:56,152 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:56,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions.
[2022-04-08 10:06:56,153 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 34
[2022-04-08 10:06:56,154 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:56,154 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions.
[2022-04-08 10:06:56,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:56,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 133 transitions.
[2022-04-08 10:06:56,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions.
[2022-04-08 10:06:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-08 10:06:56,998 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:06:56,998 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:06:57,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0
[2022-04-08 10:06:57,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52
[2022-04-08 10:06:57,198 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:06:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:06:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2379647, now seen corresponding path program 67 times
[2022-04-08 10:06:57,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:57,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [745570756]
[2022-04-08 10:06:57,200 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:06:57,201 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:06:57,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2379647, now seen corresponding path program 68 times
[2022-04-08 10:06:57,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:06:57,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496377798]
[2022-04-08 10:06:57,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:06:57,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:06:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:57,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:06:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:57,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {34870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34852#true} is VALID
[2022-04-08 10:06:57,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {34852#true} assume true; {34852#true} is VALID
[2022-04-08 10:06:57,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34852#true} {34852#true} #61#return; {34852#true} is VALID
[2022-04-08 10:06:57,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {34852#true} call ULTIMATE.init(); {34870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:06:57,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {34870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34852#true} is VALID
[2022-04-08 10:06:57,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {34852#true} assume true; {34852#true} is VALID
[2022-04-08 10:06:57,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34852#true} {34852#true} #61#return; {34852#true} is VALID
[2022-04-08 10:06:57,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {34852#true} call #t~ret11 := main(); {34852#true} is VALID
[2022-04-08 10:06:57,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {34852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34857#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:57,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {34857#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:57,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {34858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:57,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {34859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:57,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {34860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:57,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {34861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:57,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {34862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:57,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {34863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:57,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {34864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:57,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {34865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:57,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:57,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {34867#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:06:57,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {34867#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34868#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:06:57,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {34868#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34869#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {34869#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {34853#false} assume !(~y~0 % 4294967296 > 0); {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L272 TraceCheckUtils]: 30: Hoare triple {34853#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {34853#false} ~cond := #in~cond; {34853#false} is VALID
[2022-04-08 10:06:57,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {34853#false} assume 0 == ~cond; {34853#false} is VALID
[2022-04-08 10:06:57,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {34853#false} assume !false; {34853#false} is VALID
[2022-04-08 10:06:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:06:57,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:06:57,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496377798]
[2022-04-08 10:06:57,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496377798] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:06:57,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652724401]
[2022-04-08 10:06:57,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:06:57,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:06:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:06:57,403 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:06:57,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process
[2022-04-08 10:06:57,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:06:57,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:06:57,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core
[2022-04-08 10:06:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:06:57,460 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:06:57,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {34852#true} call ULTIMATE.init(); {34852#true} is VALID
[2022-04-08 10:06:57,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {34852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34852#true} is VALID
[2022-04-08 10:06:57,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {34852#true} assume true; {34852#true} is VALID
[2022-04-08 10:06:57,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34852#true} {34852#true} #61#return; {34852#true} is VALID
[2022-04-08 10:06:57,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {34852#true} call #t~ret11 := main(); {34852#true} is VALID
[2022-04-08 10:06:57,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {34852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34857#(= main_~y~0 0)} is VALID
[2022-04-08 10:06:57,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {34857#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:06:57,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {34858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:06:57,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {34859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:06:57,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {34860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:06:57,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {34861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:06:57,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {34862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:06:57,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {34863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:06:57,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {34864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:06:57,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {34865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:57,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:06:57,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {34867#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:06:57,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {34867#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34868#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:06:57,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {34868#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34928#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:06:57,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {34928#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {34853#false} is VALID
[2022-04-08 10:06:57,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:57,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {34853#false} assume !(~y~0 % 4294967296 > 0); {34853#false} is VALID
[2022-04-08 10:06:57,705 INFO L272 TraceCheckUtils]: 30: Hoare triple {34853#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34853#false} is VALID
[2022-04-08 10:06:57,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {34853#false} ~cond := #in~cond; {34853#false} is VALID
[2022-04-08 10:06:57,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {34853#false} assume 0 == ~cond; {34853#false} is VALID
[2022-04-08 10:06:57,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {34853#false} assume !false; {34853#false} is VALID
[2022-04-08 10:06:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:06:57,705 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:06:58,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {34853#false} assume !false; {34853#false} is VALID
[2022-04-08 10:06:58,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {34853#false} assume 0 == ~cond; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {34853#false} ~cond := #in~cond; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L272 TraceCheckUtils]: 30: Hoare triple {34853#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {34853#false} assume !(~y~0 % 4294967296 > 0); {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:58,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID
[2022-04-08 10:06:58,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {35016#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34853#false} is VALID
[2022-04-08 10:06:58,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {35020#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35016#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:06:58,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {35024#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35020#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:58,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {35028#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {35024#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:58,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {35028#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35028#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:58,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {35035#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35028#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:06:58,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {35039#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35035#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:06:58,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {35043#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35039#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:06:58,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {35047#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35043#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:06:58,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {35051#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35047#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:06:58,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {35055#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35051#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:06:58,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {35059#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35055#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:06:58,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {35063#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35059#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:58,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {35067#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35063#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:06:58,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {34852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35067#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:06:58,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {34852#true} call #t~ret11 := main(); {34852#true} is VALID
[2022-04-08 10:06:58,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34852#true} {34852#true} #61#return; {34852#true} is VALID
[2022-04-08 10:06:58,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {34852#true} assume true; {34852#true} is VALID
[2022-04-08 10:06:58,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {34852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34852#true} is VALID
[2022-04-08 10:06:58,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {34852#true} call ULTIMATE.init(); {34852#true} is VALID
[2022-04-08 10:06:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:06:58,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652724401] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:06:58,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:06:58,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30
[2022-04-08 10:06:58,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:06:58,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [745570756]
[2022-04-08 10:06:58,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [745570756] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:06:58,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:06:58,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-04-08 10:06:58,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767608185]
[2022-04-08 10:06:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:06:58,043 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 10:06:58,044 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:06:58,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:58,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:58,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-04-08 10:06:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:06:58,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-04-08 10:06:58,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870
[2022-04-08 10:06:58,062 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:59,201 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions.
[2022-04-08 10:06:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2022-04-08 10:06:59,201 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 10:06:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:06:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 63 transitions.
[2022-04-08 10:06:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 63 transitions.
[2022-04-08 10:06:59,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 63 transitions.
[2022-04-08 10:06:59,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:06:59,250 INFO L225 Difference]: With dead ends: 132
[2022-04-08 10:06:59,250 INFO L226 Difference]: Without dead ends: 117
[2022-04-08 10:06:59,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070
[2022-04-08 10:06:59,251 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:06:59,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:06:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2022-04-08 10:06:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106.
[2022-04-08 10:06:59,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:06:59,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:59,419 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:59,419 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:59,420 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions.
[2022-04-08 10:06:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions.
[2022-04-08 10:06:59,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:59,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:59,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states.
[2022-04-08 10:06:59,420 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states.
[2022-04-08 10:06:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:06:59,421 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions.
[2022-04-08 10:06:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions.
[2022-04-08 10:06:59,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:06:59,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:06:59,421 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:06:59,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:06:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions.
[2022-04-08 10:06:59,423 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 34
[2022-04-08 10:06:59,423 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:06:59,423 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions.
[2022-04-08 10:06:59,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:06:59,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 134 transitions.
[2022-04-08 10:07:01,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions.
[2022-04-08 10:07:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-08 10:07:01,209 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:07:01,209 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:07:01,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0
[2022-04-08 10:07:01,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:07:01,409 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:07:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:07:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1446540941, now seen corresponding path program 39 times
[2022-04-08 10:07:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:07:01,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1784102292]
[2022-04-08 10:07:01,412 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:07:01,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:07:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1446540941, now seen corresponding path program 40 times
[2022-04-08 10:07:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:07:01,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470165735]
[2022-04-08 10:07:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:07:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:07:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:01,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:07:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:01,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {35857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35830#true} is VALID
[2022-04-08 10:07:01,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {35830#true} assume true; {35830#true} is VALID
[2022-04-08 10:07:01,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35830#true} {35830#true} #61#return; {35830#true} is VALID
[2022-04-08 10:07:01,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {35830#true} call ULTIMATE.init(); {35857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:07:01,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {35857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35830#true} is VALID
[2022-04-08 10:07:01,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {35830#true} assume true; {35830#true} is VALID
[2022-04-08 10:07:01,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35830#true} {35830#true} #61#return; {35830#true} is VALID
[2022-04-08 10:07:01,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {35830#true} call #t~ret11 := main(); {35830#true} is VALID
[2022-04-08 10:07:01,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {35830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35835#(= main_~y~0 0)} is VALID
[2022-04-08 10:07:01,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {35835#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:07:01,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {35836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:07:01,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {35837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:07:01,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {35838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:07:01,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {35839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:07:01,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {35840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:07:01,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {35841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:07:01,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {35842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:01,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {35843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:07:01,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {35844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:07:01,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {35845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:07:01,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {35846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:07:01,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {35847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:07:01,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {35848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:07:01,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {35849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:07:01,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {35850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:07:01,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {35851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:07:01,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {35852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:07:01,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {35853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:07:01,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {35854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:07:01,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:07:01,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {35856#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID
[2022-04-08 10:07:01,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {35856#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35831#false} is VALID
[2022-04-08 10:07:01,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {35831#false} assume !(~y~0 % 4294967296 > 0); {35831#false} is VALID
[2022-04-08 10:07:01,794 INFO L272 TraceCheckUtils]: 30: Hoare triple {35831#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35831#false} is VALID
[2022-04-08 10:07:01,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {35831#false} ~cond := #in~cond; {35831#false} is VALID
[2022-04-08 10:07:01,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {35831#false} assume 0 == ~cond; {35831#false} is VALID
[2022-04-08 10:07:01,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {35831#false} assume !false; {35831#false} is VALID
[2022-04-08 10:07:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:07:01,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:07:01,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470165735]
[2022-04-08 10:07:01,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470165735] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:07:01,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152774989]
[2022-04-08 10:07:01,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:07:01,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:07:01,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:07:01,796 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:07:01,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process
[2022-04-08 10:07:01,833 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:07:01,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:07:01,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjunts are in the unsatisfiable core
[2022-04-08 10:07:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:01,842 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:07:02,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {35830#true} call ULTIMATE.init(); {35830#true} is VALID
[2022-04-08 10:07:02,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {35830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35830#true} is VALID
[2022-04-08 10:07:02,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {35830#true} assume true; {35830#true} is VALID
[2022-04-08 10:07:02,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35830#true} {35830#true} #61#return; {35830#true} is VALID
[2022-04-08 10:07:02,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {35830#true} call #t~ret11 := main(); {35830#true} is VALID
[2022-04-08 10:07:02,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {35830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35835#(= main_~y~0 0)} is VALID
[2022-04-08 10:07:02,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {35835#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:07:02,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {35836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:07:02,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {35837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:07:02,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {35838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:07:02,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {35839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:07:02,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {35840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:07:02,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {35841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:07:02,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {35842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:02,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {35843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:07:02,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {35844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:07:02,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {35845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:07:02,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {35846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:07:02,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {35847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:07:02,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {35848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:07:02,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {35849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:07:02,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {35850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:07:02,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {35851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:07:02,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {35852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:07:02,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {35853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:07:02,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {35854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:07:02,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:07:02,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {35942#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID
[2022-04-08 10:07:02,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {35942#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35831#false} is VALID
[2022-04-08 10:07:02,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {35831#false} assume !(~y~0 % 4294967296 > 0); {35831#false} is VALID
[2022-04-08 10:07:02,152 INFO L272 TraceCheckUtils]: 30: Hoare triple {35831#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35831#false} is VALID
[2022-04-08 10:07:02,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {35831#false} ~cond := #in~cond; {35831#false} is VALID
[2022-04-08 10:07:02,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {35831#false} assume 0 == ~cond; {35831#false} is VALID
[2022-04-08 10:07:02,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {35831#false} assume !false; {35831#false} is VALID
[2022-04-08 10:07:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:07:02,153 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:07:02,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {35831#false} assume !false; {35831#false} is VALID
[2022-04-08 10:07:02,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {35831#false} assume 0 == ~cond; {35831#false} is VALID
[2022-04-08 10:07:02,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {35831#false} ~cond := #in~cond; {35831#false} is VALID
[2022-04-08 10:07:02,944 INFO L272 TraceCheckUtils]: 30: Hoare triple {35831#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35831#false} is VALID
[2022-04-08 10:07:02,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {35831#false} assume !(~y~0 % 4294967296 > 0); {35831#false} is VALID
[2022-04-08 10:07:02,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {35976#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35831#false} is VALID
[2022-04-08 10:07:02,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {35980#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {35976#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:07:02,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {35980#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {35980#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:07:02,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {35987#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35980#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:07:02,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {35991#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35987#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:07:02,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {35995#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35991#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:07:02,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {35999#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35995#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:07:02,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {36003#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35999#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:07:02,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {36007#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36003#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:07:02,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {36011#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36007#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:07:02,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {36015#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36011#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:07:02,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {36019#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36015#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:07:02,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {36023#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36019#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:07:02,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {36027#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36023#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:07:02,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {36031#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36027#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:07:02,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {36035#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36031#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:07:02,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {36039#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36035#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:07:02,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {36043#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36039#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:07:02,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {36047#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36043#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:07:02,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {36051#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36047#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:07:02,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {36055#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36051#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:07:02,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {36059#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36055#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:07:02,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {36063#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36059#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:07:02,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {35830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36063#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:07:02,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {35830#true} call #t~ret11 := main(); {35830#true} is VALID
[2022-04-08 10:07:02,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35830#true} {35830#true} #61#return; {35830#true} is VALID
[2022-04-08 10:07:02,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {35830#true} assume true; {35830#true} is VALID
[2022-04-08 10:07:02,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {35830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35830#true} is VALID
[2022-04-08 10:07:02,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {35830#true} call ULTIMATE.init(); {35830#true} is VALID
[2022-04-08 10:07:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:07:02,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152774989] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:07:02,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:07:02,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48
[2022-04-08 10:07:02,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:07:02,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1784102292]
[2022-04-08 10:07:02,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1784102292] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:07:02,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:07:02,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2022-04-08 10:07:02,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947714574]
[2022-04-08 10:07:02,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:07:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 10:07:02,960 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:07:02,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:02,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:02,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2022-04-08 10:07:02,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:07:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2022-04-08 10:07:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256
[2022-04-08 10:07:02,980 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:06,549 INFO L93 Difference]: Finished difference Result 138 states and 190 transitions.
[2022-04-08 10:07:06,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2022-04-08 10:07:06,549 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34
[2022-04-08 10:07:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:07:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 145 transitions.
[2022-04-08 10:07:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 145 transitions.
[2022-04-08 10:07:06,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 145 transitions.
[2022-04-08 10:07:06,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:06,662 INFO L225 Difference]: With dead ends: 138
[2022-04-08 10:07:06,663 INFO L226 Difference]: Without dead ends: 132
[2022-04-08 10:07:06,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830
[2022-04-08 10:07:06,663 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 124 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-04-08 10:07:06,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 163 Invalid, 2313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-04-08 10:07:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2022-04-08 10:07:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 111.
[2022-04-08 10:07:06,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:07:06,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:06,782 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:06,783 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:06,784 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions.
[2022-04-08 10:07:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions.
[2022-04-08 10:07:06,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:07:06,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:07:06,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 132 states.
[2022-04-08 10:07:06,784 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 132 states.
[2022-04-08 10:07:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:06,785 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions.
[2022-04-08 10:07:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions.
[2022-04-08 10:07:06,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:07:06,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:07:06,785 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:07:06,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:07:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 141 transitions.
[2022-04-08 10:07:06,787 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 141 transitions. Word has length 34
[2022-04-08 10:07:06,787 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:07:06,787 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 141 transitions.
[2022-04-08 10:07:06,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:06,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 141 transitions.
[2022-04-08 10:07:09,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 140 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 141 transitions.
[2022-04-08 10:07:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2022-04-08 10:07:09,784 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:07:09,784 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:07:09,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0
[2022-04-08 10:07:09,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:07:09,985 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:07:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:07:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 69 times
[2022-04-08 10:07:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:07:09,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754589206]
[2022-04-08 10:07:09,987 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:07:09,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:07:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 70 times
[2022-04-08 10:07:09,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:07:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063676500]
[2022-04-08 10:07:09,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:07:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:07:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:10,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:07:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:10,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {36915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36890#true} is VALID
[2022-04-08 10:07:10,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {36890#true} assume true; {36890#true} is VALID
[2022-04-08 10:07:10,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36890#true} {36890#true} #61#return; {36890#true} is VALID
[2022-04-08 10:07:10,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {36890#true} call ULTIMATE.init(); {36915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:07:10,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {36915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36890#true} is VALID
[2022-04-08 10:07:10,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {36890#true} assume true; {36890#true} is VALID
[2022-04-08 10:07:10,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36890#true} {36890#true} #61#return; {36890#true} is VALID
[2022-04-08 10:07:10,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {36890#true} call #t~ret11 := main(); {36890#true} is VALID
[2022-04-08 10:07:10,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {36890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36895#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:07:10,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {36895#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36896#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:07:10,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {36896#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36897#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:07:10,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {36897#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36898#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:10,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {36898#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36899#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:07:10,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {36899#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36900#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:10,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {36900#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36901#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID
[2022-04-08 10:07:10,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {36901#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36902#(and (<= (+ 7 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) main_~n~0) (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID
[2022-04-08 10:07:10,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {36902#(and (<= (+ 7 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) main_~n~0) (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {36903#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 7) main_~n~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:07:10,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {36903#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 7) main_~n~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} is VALID
[2022-04-08 10:07:10,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} is VALID
[2022-04-08 10:07:10,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} is VALID
[2022-04-08 10:07:10,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:07:10,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:10,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:07:10,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:10,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:10,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:10,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:10,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:07:10,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:10,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:07:10,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} is VALID
[2022-04-08 10:07:10,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} is VALID
[2022-04-08 10:07:10,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:10,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:10,882 INFO L272 TraceCheckUtils]: 31: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36913#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:07:10,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {36913#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {36914#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:07:10,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {36914#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36891#false} is VALID
[2022-04-08 10:07:10,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {36891#false} assume !false; {36891#false} is VALID
[2022-04-08 10:07:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:07:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:07:10,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063676500]
[2022-04-08 10:07:10,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063676500] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:07:10,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185749928]
[2022-04-08 10:07:10,883 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:07:10,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:07:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:07:10,884 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:07:10,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process
[2022-04-08 10:07:11,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:07:11,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:07:11,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 67 conjunts are in the unsatisfiable core
[2022-04-08 10:07:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:11,050 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:07:33,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {36890#true} call ULTIMATE.init(); {36890#true} is VALID
[2022-04-08 10:07:33,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {36890#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36890#true} is VALID
[2022-04-08 10:07:33,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {36890#true} assume true; {36890#true} is VALID
[2022-04-08 10:07:33,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36890#true} {36890#true} #61#return; {36890#true} is VALID
[2022-04-08 10:07:33,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {36890#true} call #t~ret11 := main(); {36890#true} is VALID
[2022-04-08 10:07:33,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {36890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36895#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:07:33,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {36895#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36896#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:07:33,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {36896#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36940#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID
[2022-04-08 10:07:33,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {36940#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36944#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:33,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {36944#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36948#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:07:33,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {36948#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36952#(and (<= 5 main_~y~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:07:33,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {36952#(and (<= 5 main_~y~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36956#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967289 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 6 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:07:33,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {36956#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967289 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 6 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36960#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)))))} is VALID
[2022-04-08 10:07:33,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {36960#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {36903#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 7) main_~n~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:07:33,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {36903#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 7) main_~n~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} is VALID
[2022-04-08 10:07:33,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} is VALID
[2022-04-08 10:07:33,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} is VALID
[2022-04-08 10:07:33,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:07:33,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:33,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:07:33,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:33,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:33,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:33,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:33,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:07:33,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:07:33,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:07:33,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} is VALID
[2022-04-08 10:07:33,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} is VALID
[2022-04-08 10:07:33,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} is VALID
[2022-04-08 10:07:33,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} is VALID
[2022-04-08 10:07:33,577 INFO L272 TraceCheckUtils]: 31: Hoare triple {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37018#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:07:33,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {37018#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37022#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:07:33,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {37022#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36891#false} is VALID
[2022-04-08 10:07:33,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {36891#false} assume !false; {36891#false} is VALID
[2022-04-08 10:07:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:07:33,578 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:07:38,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {36891#false} assume !false; {36891#false} is VALID
[2022-04-08 10:07:38,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {37022#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36891#false} is VALID
[2022-04-08 10:07:38,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {37018#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37022#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:07:38,506 INFO L272 TraceCheckUtils]: 31: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37018#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:07:38,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {37044#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {37048#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37044#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {37052#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37048#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:07:38,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {37056#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37052#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {37060#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37056#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:07:38,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {37064#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37060#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {37068#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37064#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:07:38,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {37068#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {37068#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {37064#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37068#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {37060#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37064#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:07:38,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {37056#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37060#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {37052#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37056#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:07:38,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {37048#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37052#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {37044#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37048#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:07:38,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37044#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {37096#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:07:38,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {37100#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {37096#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:07:38,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {37104#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37100#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:07:38,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {37108#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37104#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:07:38,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {37112#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37108#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:07:38,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {37116#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37112#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:07:38,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {37120#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37116#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:07:38,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {37124#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37120#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:07:38,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {37128#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37124#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:07:38,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {36890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37128#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:07:38,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {36890#true} call #t~ret11 := main(); {36890#true} is VALID
[2022-04-08 10:07:38,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36890#true} {36890#true} #61#return; {36890#true} is VALID
[2022-04-08 10:07:38,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {36890#true} assume true; {36890#true} is VALID
[2022-04-08 10:07:38,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {36890#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36890#true} is VALID
[2022-04-08 10:07:38,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {36890#true} call ULTIMATE.init(); {36890#true} is VALID
[2022-04-08 10:07:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:07:38,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185749928] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:07:38,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:07:38,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 47
[2022-04-08 10:07:38,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:07:38,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754589206]
[2022-04-08 10:07:38,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754589206] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:07:38,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:07:38,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-04-08 10:07:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112924396]
[2022-04-08 10:07:38,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:07:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:07:38,532 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:07:38,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:38,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:38,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-04-08 10:07:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:07:38,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-04-08 10:07:38,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1947, Unknown=0, NotChecked=0, Total=2162
[2022-04-08 10:07:38,609 INFO L87 Difference]: Start difference. First operand 111 states and 141 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:43,880 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions.
[2022-04-08 10:07:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2022-04-08 10:07:43,880 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:07:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:07:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions.
[2022-04-08 10:07:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions.
[2022-04-08 10:07:43,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 55 transitions.
[2022-04-08 10:07:45,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:45,362 INFO L225 Difference]: With dead ends: 136
[2022-04-08 10:07:45,362 INFO L226 Difference]: Without dead ends: 102
[2022-04-08 10:07:45,363 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=457, Invalid=4799, Unknown=0, NotChecked=0, Total=5256
[2022-04-08 10:07:45,363 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-04-08 10:07:45,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 104 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-04-08 10:07:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2022-04-08 10:07:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102.
[2022-04-08 10:07:45,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:07:45,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:45,485 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:45,485 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:45,486 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions.
[2022-04-08 10:07:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions.
[2022-04-08 10:07:45,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:07:45,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:07:45,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states.
[2022-04-08 10:07:45,486 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states.
[2022-04-08 10:07:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:45,487 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions.
[2022-04-08 10:07:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions.
[2022-04-08 10:07:45,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:07:45,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:07:45,487 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:07:45,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:07:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions.
[2022-04-08 10:07:45,489 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 35
[2022-04-08 10:07:45,489 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:07:45,489 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions.
[2022-04-08 10:07:45,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:45,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 130 transitions.
[2022-04-08 10:07:50,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 129 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions.
[2022-04-08 10:07:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2022-04-08 10:07:50,035 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:07:50,035 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:07:50,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0
[2022-04-08 10:07:50,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:07:50,235 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:07:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:07:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash 75330479, now seen corresponding path program 71 times
[2022-04-08 10:07:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:07:50,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089287840]
[2022-04-08 10:07:50,238 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:07:50,238 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:07:50,238 INFO L85 PathProgramCache]: Analyzing trace with hash 75330479, now seen corresponding path program 72 times
[2022-04-08 10:07:50,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:07:50,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360241914]
[2022-04-08 10:07:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:07:50,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:07:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:07:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:50,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {37901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37881#true} is VALID
[2022-04-08 10:07:50,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#true} assume true; {37881#true} is VALID
[2022-04-08 10:07:50,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID
[2022-04-08 10:07:50,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:07:50,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {37901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37881#true} is VALID
[2022-04-08 10:07:50,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID
[2022-04-08 10:07:50,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID
[2022-04-08 10:07:50,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret11 := main(); {37881#true} is VALID
[2022-04-08 10:07:50,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37886#(= main_~y~0 0)} is VALID
[2022-04-08 10:07:50,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {37886#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37887#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:07:50,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {37887#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:07:50,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {37888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37889#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:07:50,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {37889#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:07:50,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {37890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37891#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:07:50,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {37891#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37892#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:07:50,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {37892#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37893#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:07:50,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {37893#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:50,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:50,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {37895#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:07:50,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {37895#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37896#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:07:50,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {37896#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37897#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:07:50,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {37897#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37898#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:07:50,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {37898#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37899#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:07:50,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {37899#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37900#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:07:50,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {37900#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {37882#false} is VALID
[2022-04-08 10:07:50,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {37882#false} assume !(~y~0 % 4294967296 > 0); {37882#false} is VALID
[2022-04-08 10:07:50,478 INFO L272 TraceCheckUtils]: 31: Hoare triple {37882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37882#false} is VALID
[2022-04-08 10:07:50,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID
[2022-04-08 10:07:50,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID
[2022-04-08 10:07:50,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {37882#false} assume !false; {37882#false} is VALID
[2022-04-08 10:07:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:07:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:07:50,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360241914]
[2022-04-08 10:07:50,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360241914] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:07:50,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158751297]
[2022-04-08 10:07:50,479 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:07:50,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:07:50,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:07:50,480 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:07:50,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process
[2022-04-08 10:07:50,583 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-08 10:07:50,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:07:50,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 42 conjunts are in the unsatisfiable core
[2022-04-08 10:07:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:50,615 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:07:50,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37881#true} is VALID
[2022-04-08 10:07:50,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37881#true} is VALID
[2022-04-08 10:07:50,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID
[2022-04-08 10:07:50,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID
[2022-04-08 10:07:50,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret11 := main(); {37881#true} is VALID
[2022-04-08 10:07:50,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37886#(= main_~y~0 0)} is VALID
[2022-04-08 10:07:50,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {37886#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37887#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:07:50,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {37887#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:07:50,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {37888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37889#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:07:50,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {37889#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:07:50,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {37890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37891#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:07:50,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {37891#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37892#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:07:50,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {37892#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37893#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:07:50,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {37893#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:50,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:50,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {37950#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:50,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {37950#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37954#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:07:50,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {37954#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37958#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:50,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {37958#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37962#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID
[2022-04-08 10:07:50,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {37962#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37966#(and (<= main_~y~0 8) (= main_~y~0 (+ main_~z~0 4)) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:50,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {37966#(and (<= main_~y~0 8) (= main_~y~0 (+ main_~z~0 4)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37970#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:50,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {37970#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {37882#false} is VALID
[2022-04-08 10:07:50,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {37882#false} assume !(~y~0 % 4294967296 > 0); {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L272 TraceCheckUtils]: 31: Hoare triple {37882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {37882#false} assume !false; {37882#false} is VALID
[2022-04-08 10:07:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:07:50,901 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:07:51,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {37882#false} assume !false; {37882#false} is VALID
[2022-04-08 10:07:51,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID
[2022-04-08 10:07:51,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID
[2022-04-08 10:07:51,300 INFO L272 TraceCheckUtils]: 31: Hoare triple {37882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37882#false} is VALID
[2022-04-08 10:07:51,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {37882#false} assume !(~y~0 % 4294967296 > 0); {37882#false} is VALID
[2022-04-08 10:07:51,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:51,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:51,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {38034#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID
[2022-04-08 10:07:51,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {38038#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38034#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:07:51,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {38042#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38038#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:07:51,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {38046#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38042#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:07:51,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {38050#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38046#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:07:51,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {38054#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38050#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:07:51,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {38058#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38054#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:07:51,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {38062#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38058#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:07:51,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {38066#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38062#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:07:51,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {38070#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38066#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:07:51,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {38074#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38070#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {38078#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38074#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {37881#true} ~z~0 := ~y~0; {38078#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {37881#true} assume !(~x~0 % 4294967296 > 0); {37881#true} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {37881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37881#true} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {37881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37881#true} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {37881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37881#true} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {37881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37881#true} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {37881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37881#true} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {37881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37881#true} is VALID
[2022-04-08 10:07:51,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {37881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37881#true} is VALID
[2022-04-08 10:07:51,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {37881#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37881#true} is VALID
[2022-04-08 10:07:51,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37881#true} is VALID
[2022-04-08 10:07:51,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret11 := main(); {37881#true} is VALID
[2022-04-08 10:07:51,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID
[2022-04-08 10:07:51,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID
[2022-04-08 10:07:51,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37881#true} is VALID
[2022-04-08 10:07:51,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37881#true} is VALID
[2022-04-08 10:07:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2022-04-08 10:07:51,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158751297] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:07:51,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:07:51,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 14] total 36
[2022-04-08 10:07:51,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:07:51,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089287840]
[2022-04-08 10:07:51,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089287840] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:07:51,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:07:51,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-04-08 10:07:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987894552]
[2022-04-08 10:07:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:07:51,311 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:07:51,311 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:07:51,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:51,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:51,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-04-08 10:07:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:07:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-04-08 10:07:51,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260
[2022-04-08 10:07:51,329 INFO L87 Difference]: Start difference. First operand 102 states and 130 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:52,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:52,378 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions.
[2022-04-08 10:07:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2022-04-08 10:07:52,378 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:07:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:07:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions.
[2022-04-08 10:07:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions.
[2022-04-08 10:07:52,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 53 transitions.
[2022-04-08 10:07:52,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:52,420 INFO L225 Difference]: With dead ends: 127
[2022-04-08 10:07:52,420 INFO L226 Difference]: Without dead ends: 113
[2022-04-08 10:07:52,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=2247, Unknown=0, NotChecked=0, Total=2550
[2022-04-08 10:07:52,420 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:07:52,420 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:07:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2022-04-08 10:07:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103.
[2022-04-08 10:07:52,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:07:52,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:52,527 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:52,528 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:52,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:52,529 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions.
[2022-04-08 10:07:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions.
[2022-04-08 10:07:52,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:07:52,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:07:52,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states.
[2022-04-08 10:07:52,529 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states.
[2022-04-08 10:07:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:52,530 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions.
[2022-04-08 10:07:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions.
[2022-04-08 10:07:52,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:07:52,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:07:52,530 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:07:52,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:07:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions.
[2022-04-08 10:07:52,531 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 35
[2022-04-08 10:07:52,531 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:07:52,531 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions.
[2022-04-08 10:07:52,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:52,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 131 transitions.
[2022-04-08 10:07:55,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions.
[2022-04-08 10:07:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2022-04-08 10:07:55,596 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:07:55,596 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:07:55,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0
[2022-04-08 10:07:55,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:07:55,797 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:07:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:07:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash 963858751, now seen corresponding path program 73 times
[2022-04-08 10:07:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:07:55,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [685414773]
[2022-04-08 10:07:55,799 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:07:55,799 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:07:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 963858751, now seen corresponding path program 74 times
[2022-04-08 10:07:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:07:55,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155110020]
[2022-04-08 10:07:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:07:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:07:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:55,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:07:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:55,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {38864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38845#true} is VALID
[2022-04-08 10:07:55,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {38845#true} assume true; {38845#true} is VALID
[2022-04-08 10:07:55,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38845#true} {38845#true} #61#return; {38845#true} is VALID
[2022-04-08 10:07:55,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {38845#true} call ULTIMATE.init(); {38864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:07:55,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {38864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38845#true} is VALID
[2022-04-08 10:07:55,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {38845#true} assume true; {38845#true} is VALID
[2022-04-08 10:07:55,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38845#true} {38845#true} #61#return; {38845#true} is VALID
[2022-04-08 10:07:55,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {38845#true} call #t~ret11 := main(); {38845#true} is VALID
[2022-04-08 10:07:55,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {38845#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38850#(= main_~y~0 0)} is VALID
[2022-04-08 10:07:55,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {38850#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38851#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:07:55,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {38851#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38852#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:07:55,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {38852#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38853#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:07:56,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {38853#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38854#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:07:56,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {38854#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38855#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:07:56,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {38855#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38856#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:07:56,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {38856#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38857#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:07:56,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {38857#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38858#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:56,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {38858#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:07:56,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:07:56,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {38860#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:07:56,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {38860#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38861#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:07:56,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {38861#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38862#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:07:56,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {38862#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38863#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:07:56,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {38863#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {38846#false} is VALID
[2022-04-08 10:07:56,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {38846#false} assume !(~y~0 % 4294967296 > 0); {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L272 TraceCheckUtils]: 31: Hoare triple {38846#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {38846#false} ~cond := #in~cond; {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {38846#false} assume 0 == ~cond; {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {38846#false} assume !false; {38846#false} is VALID
[2022-04-08 10:07:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:07:56,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:07:56,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155110020]
[2022-04-08 10:07:56,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155110020] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:07:56,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184524908]
[2022-04-08 10:07:56,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:07:56,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:07:56,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:07:56,008 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:07:56,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process
[2022-04-08 10:07:56,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:07:56,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:07:56,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 29 conjunts are in the unsatisfiable core
[2022-04-08 10:07:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:56,060 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:07:56,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {38845#true} call ULTIMATE.init(); {38845#true} is VALID
[2022-04-08 10:07:56,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {38845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38845#true} is VALID
[2022-04-08 10:07:56,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {38845#true} assume true; {38845#true} is VALID
[2022-04-08 10:07:56,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38845#true} {38845#true} #61#return; {38845#true} is VALID
[2022-04-08 10:07:56,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {38845#true} call #t~ret11 := main(); {38845#true} is VALID
[2022-04-08 10:07:56,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {38845#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38850#(= main_~y~0 0)} is VALID
[2022-04-08 10:07:56,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {38850#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38851#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:07:56,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {38851#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38852#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:07:56,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {38852#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38853#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:07:56,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {38853#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38854#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:07:56,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {38854#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38855#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:07:56,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {38855#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38856#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:07:56,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {38856#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38857#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:07:56,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {38857#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38858#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:56,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {38858#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:07:56,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:07:56,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {38860#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:07:56,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {38860#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38861#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:07:56,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {38861#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38862#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:07:56,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {38862#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38925#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:07:56,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {38925#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {38846#false} is VALID
[2022-04-08 10:07:56,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {38846#false} assume !(~y~0 % 4294967296 > 0); {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L272 TraceCheckUtils]: 31: Hoare triple {38846#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {38846#false} ~cond := #in~cond; {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {38846#false} assume 0 == ~cond; {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {38846#false} assume !false; {38846#false} is VALID
[2022-04-08 10:07:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:07:56,303 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:07:56,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {38846#false} assume !false; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {38846#false} assume 0 == ~cond; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {38846#false} ~cond := #in~cond; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L272 TraceCheckUtils]: 31: Hoare triple {38846#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {38846#false} assume !(~y~0 % 4294967296 > 0); {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID
[2022-04-08 10:07:56,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {39013#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38846#false} is VALID
[2022-04-08 10:07:56,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {39017#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39013#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:07:56,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {39021#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39017#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:07:56,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {39025#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39021#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:07:56,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {39029#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {39025#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:07:56,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {39029#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {39029#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:07:56,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {39036#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39029#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:07:56,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {39040#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39036#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:07:56,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {39044#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39040#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:07:56,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {39048#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39044#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:07:56,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {39052#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39048#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:07:56,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {39056#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39052#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:07:56,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {39060#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39056#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:07:56,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {39064#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39060#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:07:56,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {39068#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39064#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:07:56,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {38845#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39068#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:07:56,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {38845#true} call #t~ret11 := main(); {38845#true} is VALID
[2022-04-08 10:07:56,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38845#true} {38845#true} #61#return; {38845#true} is VALID
[2022-04-08 10:07:56,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {38845#true} assume true; {38845#true} is VALID
[2022-04-08 10:07:56,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {38845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38845#true} is VALID
[2022-04-08 10:07:56,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {38845#true} call ULTIMATE.init(); {38845#true} is VALID
[2022-04-08 10:07:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:07:56,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184524908] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:07:56,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:07:56,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32
[2022-04-08 10:07:56,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:07:56,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [685414773]
[2022-04-08 10:07:56,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [685414773] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:07:56,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:07:56,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-04-08 10:07:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487337792]
[2022-04-08 10:07:56,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:07:56,704 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:07:56,704 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:07:56,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:56,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:56,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-04-08 10:07:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:07:56,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-04-08 10:07:56,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992
[2022-04-08 10:07:56,723 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:57,801 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions.
[2022-04-08 10:07:57,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-04-08 10:07:57,801 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:07:57,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:07:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions.
[2022-04-08 10:07:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions.
[2022-04-08 10:07:57,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 60 transitions.
[2022-04-08 10:07:57,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:57,849 INFO L225 Difference]: With dead ends: 130
[2022-04-08 10:07:57,849 INFO L226 Difference]: Without dead ends: 115
[2022-04-08 10:07:57,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=467, Invalid=1885, Unknown=0, NotChecked=0, Total=2352
[2022-04-08 10:07:57,850 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:07:57,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:07:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2022-04-08 10:07:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104.
[2022-04-08 10:07:57,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:07:57,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:57,954 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:57,954 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:57,955 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions.
[2022-04-08 10:07:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions.
[2022-04-08 10:07:57,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:07:57,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:07:57,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states.
[2022-04-08 10:07:57,955 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states.
[2022-04-08 10:07:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:07:57,956 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions.
[2022-04-08 10:07:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions.
[2022-04-08 10:07:57,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:07:57,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:07:57,956 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:07:57,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:07:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions.
[2022-04-08 10:07:57,958 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 35
[2022-04-08 10:07:57,958 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:07:57,958 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions.
[2022-04-08 10:07:57,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:07:57,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 132 transitions.
[2022-04-08 10:07:59,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:07:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions.
[2022-04-08 10:07:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2022-04-08 10:07:59,519 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:07:59,519 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:07:59,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0
[2022-04-08 10:07:59,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57
[2022-04-08 10:07:59,720 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:07:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:07:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash 446196207, now seen corresponding path program 75 times
[2022-04-08 10:07:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:07:59,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1719038278]
[2022-04-08 10:07:59,737 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:07:59,737 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:07:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash 446196207, now seen corresponding path program 76 times
[2022-04-08 10:07:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:07:59,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545307955]
[2022-04-08 10:07:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:07:59,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:07:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:07:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:07:59,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {39839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39821#true} is VALID
[2022-04-08 10:07:59,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {39821#true} assume true; {39821#true} is VALID
[2022-04-08 10:07:59,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39821#true} {39821#true} #61#return; {39821#true} is VALID
[2022-04-08 10:07:59,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {39821#true} call ULTIMATE.init(); {39839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:07:59,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {39839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39821#true} is VALID
[2022-04-08 10:07:59,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {39821#true} assume true; {39821#true} is VALID
[2022-04-08 10:07:59,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39821#true} {39821#true} #61#return; {39821#true} is VALID
[2022-04-08 10:07:59,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {39821#true} call #t~ret11 := main(); {39821#true} is VALID
[2022-04-08 10:07:59,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {39821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39826#(= main_~y~0 0)} is VALID
[2022-04-08 10:07:59,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {39826#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39827#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:07:59,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {39827#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39828#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:07:59,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {39828#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39829#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:07:59,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {39829#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39830#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:07:59,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {39830#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39831#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:07:59,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {39831#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39832#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:07:59,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {39832#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39833#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:07:59,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {39833#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39834#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:07:59,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {39834#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39835#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:07:59,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {39835#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:07:59,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:07:59,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {39837#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:07:59,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {39837#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39838#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {39838#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {39822#false} assume !(~y~0 % 4294967296 > 0); {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L272 TraceCheckUtils]: 31: Hoare triple {39822#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39822#false} is VALID
[2022-04-08 10:07:59,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {39822#false} ~cond := #in~cond; {39822#false} is VALID
[2022-04-08 10:07:59,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {39822#false} assume 0 == ~cond; {39822#false} is VALID
[2022-04-08 10:07:59,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {39822#false} assume !false; {39822#false} is VALID
[2022-04-08 10:07:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:07:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:07:59,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545307955]
[2022-04-08 10:07:59,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545307955] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:07:59,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16032558]
[2022-04-08 10:07:59,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:07:59,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:07:59,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:07:59,957 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:07:59,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process
[2022-04-08 10:07:59,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:07:59,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:07:59,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core
[2022-04-08 10:08:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:00,011 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:00,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {39821#true} call ULTIMATE.init(); {39821#true} is VALID
[2022-04-08 10:08:00,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {39821#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39821#true} is VALID
[2022-04-08 10:08:00,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {39821#true} assume true; {39821#true} is VALID
[2022-04-08 10:08:00,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39821#true} {39821#true} #61#return; {39821#true} is VALID
[2022-04-08 10:08:00,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {39821#true} call #t~ret11 := main(); {39821#true} is VALID
[2022-04-08 10:08:00,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {39821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39826#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:00,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {39826#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39827#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:00,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {39827#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39828#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:00,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {39828#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39829#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:00,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {39829#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39830#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:00,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {39830#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39831#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:00,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {39831#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39832#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:00,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {39832#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39833#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:00,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {39833#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39834#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:00,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {39834#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39835#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:00,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {39835#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:00,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:00,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {39837#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:08:00,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {39837#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39897#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:08:00,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {39897#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {39822#false} is VALID
[2022-04-08 10:08:00,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {39822#false} assume !(~y~0 % 4294967296 > 0); {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L272 TraceCheckUtils]: 31: Hoare triple {39822#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {39822#false} ~cond := #in~cond; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {39822#false} assume 0 == ~cond; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {39822#false} assume !false; {39822#false} is VALID
[2022-04-08 10:08:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:08:00,268 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:00,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {39822#false} assume !false; {39822#false} is VALID
[2022-04-08 10:08:00,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {39822#false} assume 0 == ~cond; {39822#false} is VALID
[2022-04-08 10:08:00,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {39822#false} ~cond := #in~cond; {39822#false} is VALID
[2022-04-08 10:08:00,599 INFO L272 TraceCheckUtils]: 31: Hoare triple {39822#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39822#false} is VALID
[2022-04-08 10:08:00,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {39822#false} assume !(~y~0 % 4294967296 > 0); {39822#false} is VALID
[2022-04-08 10:08:00,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID
[2022-04-08 10:08:00,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {39991#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {39822#false} is VALID
[2022-04-08 10:08:00,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {39995#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39991#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:08:00,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {39999#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {39995#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:00,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {39999#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {39999#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:00,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {40006#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39999#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:00,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {40010#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40006#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:08:00,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {40014#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40010#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:08:00,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {40018#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40014#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:08:00,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {40022#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40018#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:08:00,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {40026#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40022#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:08:00,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {40030#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40026#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:00,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {40034#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40030#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:08:00,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {40038#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40034#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:00,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {40042#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40038#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:08:00,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {39821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40042#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:08:00,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {39821#true} call #t~ret11 := main(); {39821#true} is VALID
[2022-04-08 10:08:00,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39821#true} {39821#true} #61#return; {39821#true} is VALID
[2022-04-08 10:08:00,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {39821#true} assume true; {39821#true} is VALID
[2022-04-08 10:08:00,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {39821#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39821#true} is VALID
[2022-04-08 10:08:00,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {39821#true} call ULTIMATE.init(); {39821#true} is VALID
[2022-04-08 10:08:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:08:00,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16032558] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:00,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:00,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30
[2022-04-08 10:08:00,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:00,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1719038278]
[2022-04-08 10:08:00,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1719038278] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:00,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:00,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2022-04-08 10:08:00,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147936691]
[2022-04-08 10:08:00,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:00,611 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:08:00,611 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:00,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:00,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:00,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2022-04-08 10:08:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:00,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2022-04-08 10:08:00,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870
[2022-04-08 10:08:00,627 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:01,648 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions.
[2022-04-08 10:08:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2022-04-08 10:08:01,648 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:08:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:08:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions.
[2022-04-08 10:08:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions.
[2022-04-08 10:08:01,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 62 transitions.
[2022-04-08 10:08:01,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:01,700 INFO L225 Difference]: With dead ends: 133
[2022-04-08 10:08:01,700 INFO L226 Difference]: Without dead ends: 117
[2022-04-08 10:08:01,701 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892
[2022-04-08 10:08:01,701 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:08:01,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 81 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:08:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2022-04-08 10:08:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105.
[2022-04-08 10:08:01,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:08:01,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:01,829 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:01,829 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:01,830 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions.
[2022-04-08 10:08:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions.
[2022-04-08 10:08:01,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:01,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:01,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states.
[2022-04-08 10:08:01,830 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states.
[2022-04-08 10:08:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:01,831 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions.
[2022-04-08 10:08:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions.
[2022-04-08 10:08:01,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:01,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:01,831 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:08:01,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:08:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions.
[2022-04-08 10:08:01,832 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 35
[2022-04-08 10:08:01,833 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:08:01,833 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions.
[2022-04-08 10:08:01,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:01,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 133 transitions.
[2022-04-08 10:08:07,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 131 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions.
[2022-04-08 10:08:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2022-04-08 10:08:07,153 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:08:07,153 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:08:07,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0
[2022-04-08 10:08:07,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58
[2022-04-08 10:08:07,354 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:08:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:08:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1549015186, now seen corresponding path program 41 times
[2022-04-08 10:08:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:07,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284904449]
[2022-04-08 10:08:07,356 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:08:07,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:08:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1549015186, now seen corresponding path program 42 times
[2022-04-08 10:08:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:08:07,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293192734]
[2022-04-08 10:08:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:08:07,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:08:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:07,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:08:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:07,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {40829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40801#true} is VALID
[2022-04-08 10:08:07,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {40801#true} assume true; {40801#true} is VALID
[2022-04-08 10:08:07,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40801#true} {40801#true} #61#return; {40801#true} is VALID
[2022-04-08 10:08:07,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {40801#true} call ULTIMATE.init(); {40829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:08:07,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {40829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40801#true} is VALID
[2022-04-08 10:08:07,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {40801#true} assume true; {40801#true} is VALID
[2022-04-08 10:08:07,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40801#true} {40801#true} #61#return; {40801#true} is VALID
[2022-04-08 10:08:07,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {40801#true} call #t~ret11 := main(); {40801#true} is VALID
[2022-04-08 10:08:07,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {40801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40806#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:07,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {40806#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40807#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:07,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {40807#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:07,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {40808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40809#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:07,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {40809#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40810#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:07,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {40810#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40811#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:07,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {40811#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40812#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:07,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {40812#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:07,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {40813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40814#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:07,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {40814#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40815#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:07,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {40815#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40816#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:07,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {40816#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:08:07,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {40817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40818#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:08:07,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {40818#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40819#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:08:07,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {40819#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40820#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:08:07,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {40820#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40821#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:08:07,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {40821#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40822#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:08:07,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {40822#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40823#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:08:07,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {40823#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40824#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:08:07,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {40824#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40825#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:08:07,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {40825#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40826#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:08:07,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {40826#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:08:07,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:08:07,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {40828#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID
[2022-04-08 10:08:07,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {40828#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40802#false} is VALID
[2022-04-08 10:08:07,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {40802#false} assume !(~y~0 % 4294967296 > 0); {40802#false} is VALID
[2022-04-08 10:08:07,787 INFO L272 TraceCheckUtils]: 31: Hoare triple {40802#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40802#false} is VALID
[2022-04-08 10:08:07,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {40802#false} ~cond := #in~cond; {40802#false} is VALID
[2022-04-08 10:08:07,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {40802#false} assume 0 == ~cond; {40802#false} is VALID
[2022-04-08 10:08:07,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {40802#false} assume !false; {40802#false} is VALID
[2022-04-08 10:08:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:08:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:08:07,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293192734]
[2022-04-08 10:08:07,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293192734] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:08:07,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030290584]
[2022-04-08 10:08:07,788 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:08:07,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:07,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:08:07,789 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:08:07,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process
[2022-04-08 10:08:08,194 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s)
[2022-04-08 10:08:08,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:08:08,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 47 conjunts are in the unsatisfiable core
[2022-04-08 10:08:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:08,205 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:08,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {40801#true} call ULTIMATE.init(); {40801#true} is VALID
[2022-04-08 10:08:08,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {40801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40801#true} is VALID
[2022-04-08 10:08:08,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {40801#true} assume true; {40801#true} is VALID
[2022-04-08 10:08:08,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40801#true} {40801#true} #61#return; {40801#true} is VALID
[2022-04-08 10:08:08,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {40801#true} call #t~ret11 := main(); {40801#true} is VALID
[2022-04-08 10:08:08,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {40801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40806#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:08,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {40806#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40807#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:08,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {40807#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:08,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {40808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40809#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:08,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {40809#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40810#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:08,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {40810#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40811#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:08,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {40811#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40812#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:08,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {40812#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:08,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {40813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40814#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:08,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {40814#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40815#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:08,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {40815#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40816#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:08,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {40816#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:08:08,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {40817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40818#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:08:08,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {40818#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40819#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:08:08,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {40819#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40820#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:08:08,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {40820#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40821#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:08:08,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {40821#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40822#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:08:08,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {40822#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40823#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:08:08,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {40823#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40824#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:08:08,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {40824#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40825#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:08:08,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {40825#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40826#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:08:08,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {40826#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:08:08,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:08:08,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {40917#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID
[2022-04-08 10:08:08,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {40917#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40802#false} is VALID
[2022-04-08 10:08:08,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {40802#false} assume !(~y~0 % 4294967296 > 0); {40802#false} is VALID
[2022-04-08 10:08:08,520 INFO L272 TraceCheckUtils]: 31: Hoare triple {40802#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40802#false} is VALID
[2022-04-08 10:08:08,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {40802#false} ~cond := #in~cond; {40802#false} is VALID
[2022-04-08 10:08:08,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {40802#false} assume 0 == ~cond; {40802#false} is VALID
[2022-04-08 10:08:08,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {40802#false} assume !false; {40802#false} is VALID
[2022-04-08 10:08:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:08:08,520 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:09,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {40802#false} assume !false; {40802#false} is VALID
[2022-04-08 10:08:09,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {40802#false} assume 0 == ~cond; {40802#false} is VALID
[2022-04-08 10:08:09,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {40802#false} ~cond := #in~cond; {40802#false} is VALID
[2022-04-08 10:08:09,400 INFO L272 TraceCheckUtils]: 31: Hoare triple {40802#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40802#false} is VALID
[2022-04-08 10:08:09,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {40802#false} assume !(~y~0 % 4294967296 > 0); {40802#false} is VALID
[2022-04-08 10:08:09,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {40951#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40802#false} is VALID
[2022-04-08 10:08:09,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {40955#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {40951#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:08:09,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {40955#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40955#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:08:09,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {40962#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40955#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:08:09,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {40966#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40962#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:08:09,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {40970#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40966#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:08:09,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {40974#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40970#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:08:09,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {40978#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40974#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:08:09,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {40982#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40978#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:09,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {40986#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40982#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:08:09,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {40990#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40986#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:09,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {40994#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40990#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:08:09,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {40998#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40994#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:08:09,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {41002#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40998#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:08:09,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {41006#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41002#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:08:09,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {41010#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41006#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:08:09,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {41014#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41010#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:08:09,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {41018#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41014#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:08:09,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {41022#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41018#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:08:09,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {41026#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41022#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:08:09,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {41030#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41026#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:08:09,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {41034#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41030#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:08:09,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {41038#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41034#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:09,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {41042#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41038#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:08:09,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {40801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41042#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID
[2022-04-08 10:08:09,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {40801#true} call #t~ret11 := main(); {40801#true} is VALID
[2022-04-08 10:08:09,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40801#true} {40801#true} #61#return; {40801#true} is VALID
[2022-04-08 10:08:09,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {40801#true} assume true; {40801#true} is VALID
[2022-04-08 10:08:09,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {40801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40801#true} is VALID
[2022-04-08 10:08:09,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {40801#true} call ULTIMATE.init(); {40801#true} is VALID
[2022-04-08 10:08:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:08:09,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030290584] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:09,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:09,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50
[2022-04-08 10:08:09,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:09,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284904449]
[2022-04-08 10:08:09,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284904449] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:09,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:09,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2022-04-08 10:08:09,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040317221]
[2022-04-08 10:08:09,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:09,416 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:08:09,417 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:09,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:09,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:09,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2022-04-08 10:08:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:09,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2022-04-08 10:08:09,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450
[2022-04-08 10:08:09,437 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:13,306 INFO L93 Difference]: Finished difference Result 138 states and 191 transitions.
[2022-04-08 10:08:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2022-04-08 10:08:13,307 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35
[2022-04-08 10:08:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:08:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 148 transitions.
[2022-04-08 10:08:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 148 transitions.
[2022-04-08 10:08:13,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 148 transitions.
[2022-04-08 10:08:13,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:13,426 INFO L225 Difference]: With dead ends: 138
[2022-04-08 10:08:13,426 INFO L226 Difference]: Without dead ends: 132
[2022-04-08 10:08:13,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1183, Invalid=4073, Unknown=0, NotChecked=0, Total=5256
[2022-04-08 10:08:13,427 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 124 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2022-04-08 10:08:13,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 168 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-04-08 10:08:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2022-04-08 10:08:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110.
[2022-04-08 10:08:13,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:08:13,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:13,543 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:13,543 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:13,545 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions.
[2022-04-08 10:08:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions.
[2022-04-08 10:08:13,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:13,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:13,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 132 states.
[2022-04-08 10:08:13,545 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 132 states.
[2022-04-08 10:08:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:13,547 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions.
[2022-04-08 10:08:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions.
[2022-04-08 10:08:13,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:13,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:13,547 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:08:13,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:08:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions.
[2022-04-08 10:08:13,549 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 35
[2022-04-08 10:08:13,549 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:08:13,549 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions.
[2022-04-08 10:08:13,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:13,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 140 transitions.
[2022-04-08 10:08:14,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions.
[2022-04-08 10:08:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-08 10:08:14,526 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:08:14,526 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:08:14,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0
[2022-04-08 10:08:14,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59
[2022-04-08 10:08:14,727 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:08:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:08:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash -927796211, now seen corresponding path program 77 times
[2022-04-08 10:08:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:14,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1114285891]
[2022-04-08 10:08:14,729 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:08:14,729 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:08:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash -927796211, now seen corresponding path program 78 times
[2022-04-08 10:08:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:08:14,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789354241]
[2022-04-08 10:08:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:08:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:08:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:08:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:14,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {41890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41869#true} is VALID
[2022-04-08 10:08:14,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {41869#true} assume true; {41869#true} is VALID
[2022-04-08 10:08:14,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41869#true} {41869#true} #61#return; {41869#true} is VALID
[2022-04-08 10:08:14,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {41869#true} call ULTIMATE.init(); {41890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:08:14,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {41890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41869#true} is VALID
[2022-04-08 10:08:14,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {41869#true} assume true; {41869#true} is VALID
[2022-04-08 10:08:14,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41869#true} {41869#true} #61#return; {41869#true} is VALID
[2022-04-08 10:08:14,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {41869#true} call #t~ret11 := main(); {41869#true} is VALID
[2022-04-08 10:08:14,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {41869#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41874#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:14,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {41874#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41875#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:14,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {41875#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:14,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {41876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41877#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:14,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {41877#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41878#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:14,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {41878#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41879#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:14,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {41879#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41880#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:14,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {41880#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:14,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {41881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:14,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:14,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {41883#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:08:14,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {41883#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41884#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:08:14,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {41884#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41885#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:08:14,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {41885#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41886#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:08:14,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {41886#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41887#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:08:14,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {41887#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41888#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:08:14,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {41888#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41889#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:08:14,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {41889#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {41870#false} assume !(~y~0 % 4294967296 > 0); {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L272 TraceCheckUtils]: 32: Hoare triple {41870#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {41870#false} ~cond := #in~cond; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {41870#false} assume 0 == ~cond; {41870#false} is VALID
[2022-04-08 10:08:14,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {41870#false} assume !false; {41870#false} is VALID
[2022-04-08 10:08:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:08:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:08:14,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789354241]
[2022-04-08 10:08:14,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789354241] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:08:14,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608092018]
[2022-04-08 10:08:14,972 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:08:14,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:14,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:08:14,973 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:08:14,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process
[2022-04-08 10:08:15,067 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-08 10:08:15,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:08:15,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 46 conjunts are in the unsatisfiable core
[2022-04-08 10:08:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:15,078 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:15,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {41869#true} call ULTIMATE.init(); {41869#true} is VALID
[2022-04-08 10:08:15,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {41869#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41869#true} is VALID
[2022-04-08 10:08:15,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {41869#true} assume true; {41869#true} is VALID
[2022-04-08 10:08:15,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41869#true} {41869#true} #61#return; {41869#true} is VALID
[2022-04-08 10:08:15,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {41869#true} call #t~ret11 := main(); {41869#true} is VALID
[2022-04-08 10:08:15,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {41869#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41874#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:15,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {41874#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41875#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:15,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {41875#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:15,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {41876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41877#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:15,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {41877#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41878#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:15,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {41878#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41879#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:15,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {41879#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41880#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:15,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {41880#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:15,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {41881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:15,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:15,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {41939#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:15,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {41939#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41943#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:08:15,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {41943#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41947#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:15,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {41947#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41951#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:15,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {41951#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41955#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID
[2022-04-08 10:08:15,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {41955#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41959#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:15,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {41959#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41963#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {41963#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {41870#false} assume !(~y~0 % 4294967296 > 0); {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L272 TraceCheckUtils]: 32: Hoare triple {41870#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {41870#false} ~cond := #in~cond; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {41870#false} assume 0 == ~cond; {41870#false} is VALID
[2022-04-08 10:08:15,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {41870#false} assume !false; {41870#false} is VALID
[2022-04-08 10:08:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:08:15,405 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:15,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {41870#false} assume !false; {41870#false} is VALID
[2022-04-08 10:08:15,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {41870#false} assume 0 == ~cond; {41870#false} is VALID
[2022-04-08 10:08:15,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {41870#false} ~cond := #in~cond; {41870#false} is VALID
[2022-04-08 10:08:15,868 INFO L272 TraceCheckUtils]: 32: Hoare triple {41870#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41870#false} is VALID
[2022-04-08 10:08:15,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {41870#false} assume !(~y~0 % 4294967296 > 0); {41870#false} is VALID
[2022-04-08 10:08:15,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {42024#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID
[2022-04-08 10:08:15,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {42028#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42024#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:08:15,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {42032#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42028#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:08:15,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {42036#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42032#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:08:15,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {42040#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42036#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:08:15,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {42044#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42040#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:08:15,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {42048#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42044#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:08:15,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {42052#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {42048#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:08:15,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {42056#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42052#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:08:15,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {42060#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42056#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:08:15,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {42064#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42060#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:08:15,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {42068#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42064#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:08:15,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {42072#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42068#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:08:15,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {42076#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42072#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:08:15,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {41869#true} ~z~0 := ~y~0; {42076#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:08:15,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {41869#true} assume !(~x~0 % 4294967296 > 0); {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {41869#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {41869#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {41869#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {41869#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {41869#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {41869#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {41869#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {41869#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {41869#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {41869#true} call #t~ret11 := main(); {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41869#true} {41869#true} #61#return; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {41869#true} assume true; {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {41869#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41869#true} is VALID
[2022-04-08 10:08:15,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {41869#true} call ULTIMATE.init(); {41869#true} is VALID
[2022-04-08 10:08:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked.
[2022-04-08 10:08:15,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608092018] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:15,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:15,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 40
[2022-04-08 10:08:15,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:15,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1114285891]
[2022-04-08 10:08:15,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1114285891] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:15,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:15,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2022-04-08 10:08:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836913047]
[2022-04-08 10:08:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:15,881 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36
[2022-04-08 10:08:15,881 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:15,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:15,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:15,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-08 10:08:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-08 10:08:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560
[2022-04-08 10:08:15,900 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:17,003 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions.
[2022-04-08 10:08:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2022-04-08 10:08:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36
[2022-04-08 10:08:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:08:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions.
[2022-04-08 10:08:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions.
[2022-04-08 10:08:17,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 54 transitions.
[2022-04-08 10:08:17,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:17,046 INFO L225 Difference]: With dead ends: 135
[2022-04-08 10:08:17,046 INFO L226 Difference]: Without dead ends: 121
[2022-04-08 10:08:17,046 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=2722, Unknown=0, NotChecked=0, Total=3080
[2022-04-08 10:08:17,046 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:08:17,046 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:08:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2022-04-08 10:08:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111.
[2022-04-08 10:08:17,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:08:17,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:17,175 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:17,175 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:17,176 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions.
[2022-04-08 10:08:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions.
[2022-04-08 10:08:17,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:17,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:17,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states.
[2022-04-08 10:08:17,177 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states.
[2022-04-08 10:08:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:17,178 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions.
[2022-04-08 10:08:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions.
[2022-04-08 10:08:17,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:17,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:17,178 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:08:17,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:08:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 141 transitions.
[2022-04-08 10:08:17,179 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 141 transitions. Word has length 36
[2022-04-08 10:08:17,179 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:08:17,179 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 141 transitions.
[2022-04-08 10:08:17,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:17,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 141 transitions.
[2022-04-08 10:08:19,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 141 transitions.
[2022-04-08 10:08:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-08 10:08:19,437 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:08:19,437 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:08:19,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0
[2022-04-08 10:08:19,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:19,637 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:08:19,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:08:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash 704939903, now seen corresponding path program 79 times
[2022-04-08 10:08:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:19,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1984953478]
[2022-04-08 10:08:19,640 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:08:19,640 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:08:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash 704939903, now seen corresponding path program 80 times
[2022-04-08 10:08:19,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:08:19,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157710089]
[2022-04-08 10:08:19,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:08:19,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:08:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:19,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:08:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:19,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {42913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42893#true} is VALID
[2022-04-08 10:08:19,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {42893#true} assume true; {42893#true} is VALID
[2022-04-08 10:08:19,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42893#true} {42893#true} #61#return; {42893#true} is VALID
[2022-04-08 10:08:19,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {42893#true} call ULTIMATE.init(); {42913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:08:19,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {42913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42893#true} is VALID
[2022-04-08 10:08:19,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {42893#true} assume true; {42893#true} is VALID
[2022-04-08 10:08:19,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42893#true} {42893#true} #61#return; {42893#true} is VALID
[2022-04-08 10:08:19,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {42893#true} call #t~ret11 := main(); {42893#true} is VALID
[2022-04-08 10:08:19,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {42893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42898#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:19,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {42898#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:19,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {42899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:19,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {42900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:19,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {42901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:19,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {42902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:19,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {42903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:19,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {42904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:19,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {42905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:19,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {42906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:19,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:19,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {42908#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:08:19,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {42908#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42909#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:08:19,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {42909#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42910#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:08:19,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {42910#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42911#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:08:19,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {42911#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42912#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:08:19,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {42912#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {42894#false} is VALID
[2022-04-08 10:08:19,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:19,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:19,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:19,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:19,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:19,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:19,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:19,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:19,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:19,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {42894#false} assume !(~y~0 % 4294967296 > 0); {42894#false} is VALID
[2022-04-08 10:08:19,908 INFO L272 TraceCheckUtils]: 32: Hoare triple {42894#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42894#false} is VALID
[2022-04-08 10:08:19,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {42894#false} ~cond := #in~cond; {42894#false} is VALID
[2022-04-08 10:08:19,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {42894#false} assume 0 == ~cond; {42894#false} is VALID
[2022-04-08 10:08:19,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {42894#false} assume !false; {42894#false} is VALID
[2022-04-08 10:08:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:08:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:08:19,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157710089]
[2022-04-08 10:08:19,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157710089] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:08:19,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808090703]
[2022-04-08 10:08:19,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:08:19,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:19,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:08:19,909 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:08:19,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process
[2022-04-08 10:08:19,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:08:19,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:08:19,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjunts are in the unsatisfiable core
[2022-04-08 10:08:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:19,960 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:20,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {42893#true} call ULTIMATE.init(); {42893#true} is VALID
[2022-04-08 10:08:20,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {42893#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42893#true} is VALID
[2022-04-08 10:08:20,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {42893#true} assume true; {42893#true} is VALID
[2022-04-08 10:08:20,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42893#true} {42893#true} #61#return; {42893#true} is VALID
[2022-04-08 10:08:20,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {42893#true} call #t~ret11 := main(); {42893#true} is VALID
[2022-04-08 10:08:20,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {42893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42898#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:20,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {42898#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:20,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {42899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:20,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {42900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:20,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {42901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:20,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {42902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:20,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {42903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:20,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {42904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:20,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {42905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:20,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {42906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:20,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:20,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {42908#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:08:20,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {42908#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42909#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:08:20,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {42909#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42910#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:08:20,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {42910#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42911#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:08:20,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {42911#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42977#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:08:20,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {42977#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {42894#false} assume !(~y~0 % 4294967296 > 0); {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L272 TraceCheckUtils]: 32: Hoare triple {42894#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {42894#false} ~cond := #in~cond; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {42894#false} assume 0 == ~cond; {42894#false} is VALID
[2022-04-08 10:08:20,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {42894#false} assume !false; {42894#false} is VALID
[2022-04-08 10:08:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:08:20,207 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:20,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {42894#false} assume !false; {42894#false} is VALID
[2022-04-08 10:08:20,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {42894#false} assume 0 == ~cond; {42894#false} is VALID
[2022-04-08 10:08:20,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {42894#false} ~cond := #in~cond; {42894#false} is VALID
[2022-04-08 10:08:20,624 INFO L272 TraceCheckUtils]: 32: Hoare triple {42894#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42894#false} is VALID
[2022-04-08 10:08:20,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {42894#false} assume !(~y~0 % 4294967296 > 0); {42894#false} is VALID
[2022-04-08 10:08:20,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID
[2022-04-08 10:08:20,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {43065#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {42894#false} is VALID
[2022-04-08 10:08:20,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {43069#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43065#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:08:20,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {43073#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43069#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:20,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {43077#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43073#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:08:20,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {43081#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43077#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:08:20,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {43085#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {43081#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:08:20,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {43085#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43085#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:20,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {43092#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43085#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:20,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {43096#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43092#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:08:20,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {43100#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43096#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:08:20,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {43104#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43100#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:20,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {43108#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43104#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:08:20,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {43112#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43108#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:08:20,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {43116#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43112#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:08:20,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {43120#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43116#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:08:20,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {43124#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43120#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:08:20,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {42893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43124#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:20,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {42893#true} call #t~ret11 := main(); {42893#true} is VALID
[2022-04-08 10:08:20,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42893#true} {42893#true} #61#return; {42893#true} is VALID
[2022-04-08 10:08:20,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {42893#true} assume true; {42893#true} is VALID
[2022-04-08 10:08:20,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {42893#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42893#true} is VALID
[2022-04-08 10:08:20,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {42893#true} call ULTIMATE.init(); {42893#true} is VALID
[2022-04-08 10:08:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:08:20,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808090703] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:20,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:20,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34
[2022-04-08 10:08:20,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:20,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1984953478]
[2022-04-08 10:08:20,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1984953478] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:20,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:20,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-04-08 10:08:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959759759]
[2022-04-08 10:08:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:20,637 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36
[2022-04-08 10:08:20,637 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:20,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:20,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:20,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-04-08 10:08:20,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:20,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-04-08 10:08:20,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122
[2022-04-08 10:08:20,654 INFO L87 Difference]: Start difference. First operand 111 states and 141 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:22,005 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions.
[2022-04-08 10:08:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-04-08 10:08:22,005 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36
[2022-04-08 10:08:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:08:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions.
[2022-04-08 10:08:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions.
[2022-04-08 10:08:22,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 62 transitions.
[2022-04-08 10:08:22,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:22,055 INFO L225 Difference]: With dead ends: 138
[2022-04-08 10:08:22,055 INFO L226 Difference]: Without dead ends: 123
[2022-04-08 10:08:22,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=533, Invalid=2223, Unknown=0, NotChecked=0, Total=2756
[2022-04-08 10:08:22,056 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:08:22,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:08:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2022-04-08 10:08:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112.
[2022-04-08 10:08:22,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:08:22,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:22,175 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:22,175 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:22,176 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions.
[2022-04-08 10:08:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions.
[2022-04-08 10:08:22,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:22,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:22,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states.
[2022-04-08 10:08:22,177 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states.
[2022-04-08 10:08:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:22,178 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions.
[2022-04-08 10:08:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions.
[2022-04-08 10:08:22,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:22,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:22,178 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:08:22,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:08:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 142 transitions.
[2022-04-08 10:08:22,179 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 142 transitions. Word has length 36
[2022-04-08 10:08:22,179 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:08:22,180 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 142 transitions.
[2022-04-08 10:08:22,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:22,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 142 transitions.
[2022-04-08 10:08:25,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 141 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 142 transitions.
[2022-04-08 10:08:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-08 10:08:25,873 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:08:25,873 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:08:25,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0
[2022-04-08 10:08:26,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:26,074 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:08:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:08:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1735304717, now seen corresponding path program 81 times
[2022-04-08 10:08:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:26,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1938176609]
[2022-04-08 10:08:26,078 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:08:26,079 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:08:26,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1735304717, now seen corresponding path program 82 times
[2022-04-08 10:08:26,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:08:26,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162045513]
[2022-04-08 10:08:26,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:08:26,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:08:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:26,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:08:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:26,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {43948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43929#true} is VALID
[2022-04-08 10:08:26,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {43929#true} assume true; {43929#true} is VALID
[2022-04-08 10:08:26,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43929#true} {43929#true} #61#return; {43929#true} is VALID
[2022-04-08 10:08:26,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {43929#true} call ULTIMATE.init(); {43948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:08:26,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {43948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43929#true} is VALID
[2022-04-08 10:08:26,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {43929#true} assume true; {43929#true} is VALID
[2022-04-08 10:08:26,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43929#true} {43929#true} #61#return; {43929#true} is VALID
[2022-04-08 10:08:26,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {43929#true} call #t~ret11 := main(); {43929#true} is VALID
[2022-04-08 10:08:26,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {43929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43934#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:26,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {43934#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:26,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {43935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:26,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {43936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:26,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {43937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:26,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {43938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:26,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {43939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:26,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {43940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:26,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {43941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:26,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {43942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:26,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {43943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:26,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:26,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {43945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:08:26,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {43945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43946#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:08:26,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {43946#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43947#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:08:26,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {43947#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {43930#false} is VALID
[2022-04-08 10:08:26,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {43930#false} assume !(~y~0 % 4294967296 > 0); {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L272 TraceCheckUtils]: 32: Hoare triple {43930#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {43930#false} ~cond := #in~cond; {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {43930#false} assume 0 == ~cond; {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {43930#false} assume !false; {43930#false} is VALID
[2022-04-08 10:08:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:08:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:08:26,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162045513]
[2022-04-08 10:08:26,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162045513] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:08:26,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260170898]
[2022-04-08 10:08:26,292 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:08:26,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:26,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:08:26,293 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:08:26,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process
[2022-04-08 10:08:26,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:08:26,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:08:26,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core
[2022-04-08 10:08:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:26,344 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:26,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {43929#true} call ULTIMATE.init(); {43929#true} is VALID
[2022-04-08 10:08:26,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {43929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43929#true} is VALID
[2022-04-08 10:08:26,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {43929#true} assume true; {43929#true} is VALID
[2022-04-08 10:08:26,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43929#true} {43929#true} #61#return; {43929#true} is VALID
[2022-04-08 10:08:26,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {43929#true} call #t~ret11 := main(); {43929#true} is VALID
[2022-04-08 10:08:26,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {43929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43934#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:26,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {43934#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:26,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {43935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:26,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {43936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:26,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {43937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:26,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {43938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:26,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {43939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:26,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {43940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:26,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {43941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:26,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {43942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:26,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {43943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:26,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:26,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {43945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:08:26,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {43945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43946#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:08:26,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {43946#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44009#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:08:26,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {44009#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {43930#false} is VALID
[2022-04-08 10:08:26,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {43930#false} assume !(~y~0 % 4294967296 > 0); {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L272 TraceCheckUtils]: 32: Hoare triple {43930#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {43930#false} ~cond := #in~cond; {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {43930#false} assume 0 == ~cond; {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {43930#false} assume !false; {43930#false} is VALID
[2022-04-08 10:08:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:08:26,584 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:27,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {43930#false} assume !false; {43930#false} is VALID
[2022-04-08 10:08:27,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {43930#false} assume 0 == ~cond; {43930#false} is VALID
[2022-04-08 10:08:27,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {43930#false} ~cond := #in~cond; {43930#false} is VALID
[2022-04-08 10:08:27,012 INFO L272 TraceCheckUtils]: 32: Hoare triple {43930#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43930#false} is VALID
[2022-04-08 10:08:27,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {43930#false} assume !(~y~0 % 4294967296 > 0); {43930#false} is VALID
[2022-04-08 10:08:27,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID
[2022-04-08 10:08:27,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {44103#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43930#false} is VALID
[2022-04-08 10:08:27,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {44107#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44103#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:08:27,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {44111#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44107#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:27,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {44115#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {44111#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:08:27,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {44115#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {44115#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:08:27,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {44122#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44115#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:08:27,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {44126#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44122#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:27,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {44130#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44126#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:08:27,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {44134#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44130#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:08:27,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {44138#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44134#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:08:27,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {44142#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44138#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:08:27,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {44146#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44142#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:08:27,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {44150#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44146#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:27,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {44154#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44150#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:08:27,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {44158#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44154#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:27,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {43929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44158#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:08:27,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {43929#true} call #t~ret11 := main(); {43929#true} is VALID
[2022-04-08 10:08:27,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43929#true} {43929#true} #61#return; {43929#true} is VALID
[2022-04-08 10:08:27,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {43929#true} assume true; {43929#true} is VALID
[2022-04-08 10:08:27,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {43929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43929#true} is VALID
[2022-04-08 10:08:27,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {43929#true} call ULTIMATE.init(); {43929#true} is VALID
[2022-04-08 10:08:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:08:27,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260170898] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:27,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:27,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32
[2022-04-08 10:08:27,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:27,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1938176609]
[2022-04-08 10:08:27,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1938176609] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:27,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:27,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-04-08 10:08:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236844642]
[2022-04-08 10:08:27,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:27,026 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36
[2022-04-08 10:08:27,026 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:27,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:27,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:27,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-04-08 10:08:27,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:27,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-04-08 10:08:27,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992
[2022-04-08 10:08:27,045 INFO L87 Difference]: Start difference. First operand 112 states and 142 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:28,266 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions.
[2022-04-08 10:08:28,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-04-08 10:08:28,266 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36
[2022-04-08 10:08:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:08:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 65 transitions.
[2022-04-08 10:08:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 65 transitions.
[2022-04-08 10:08:28,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 65 transitions.
[2022-04-08 10:08:28,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:28,318 INFO L225 Difference]: With dead ends: 141
[2022-04-08 10:08:28,318 INFO L226 Difference]: Without dead ends: 125
[2022-04-08 10:08:28,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352
[2022-04-08 10:08:28,318 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:08:28,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 87 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:08:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2022-04-08 10:08:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113.
[2022-04-08 10:08:28,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:08:28,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:28,438 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:28,438 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:28,449 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions.
[2022-04-08 10:08:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions.
[2022-04-08 10:08:28,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:28,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:28,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states.
[2022-04-08 10:08:28,450 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states.
[2022-04-08 10:08:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:28,451 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions.
[2022-04-08 10:08:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions.
[2022-04-08 10:08:28,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:28,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:28,451 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:08:28,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:08:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions.
[2022-04-08 10:08:28,452 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 36
[2022-04-08 10:08:28,452 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:08:28,452 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions.
[2022-04-08 10:08:28,453 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:28,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 143 transitions.
[2022-04-08 10:08:31,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions.
[2022-04-08 10:08:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-08 10:08:31,287 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:08:31,287 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:08:31,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0
[2022-04-08 10:08:31,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:31,502 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:08:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:08:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash 78025389, now seen corresponding path program 43 times
[2022-04-08 10:08:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:31,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [124709708]
[2022-04-08 10:08:31,505 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:08:31,505 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:08:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash 78025389, now seen corresponding path program 44 times
[2022-04-08 10:08:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:08:31,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994623777]
[2022-04-08 10:08:31,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:08:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:08:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:08:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:31,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {45000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44971#true} is VALID
[2022-04-08 10:08:31,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {44971#true} assume true; {44971#true} is VALID
[2022-04-08 10:08:31,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44971#true} {44971#true} #61#return; {44971#true} is VALID
[2022-04-08 10:08:31,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {44971#true} call ULTIMATE.init(); {45000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:08:31,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {45000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44971#true} is VALID
[2022-04-08 10:08:31,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {44971#true} assume true; {44971#true} is VALID
[2022-04-08 10:08:31,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44971#true} {44971#true} #61#return; {44971#true} is VALID
[2022-04-08 10:08:31,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {44971#true} call #t~ret11 := main(); {44971#true} is VALID
[2022-04-08 10:08:31,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {44971#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44976#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:31,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {44976#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44977#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:31,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {44977#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:31,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {44978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44979#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:31,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {44979#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44980#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:31,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {44980#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:31,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {44981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44982#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:31,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {44982#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44983#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:31,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {44983#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44984#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:31,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {44984#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44985#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:31,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {44985#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44986#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:31,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {44986#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44987#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:08:31,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {44987#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44988#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:08:31,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {44988#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44989#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:08:31,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {44989#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44990#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:08:31,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {44990#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44991#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:08:31,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {44991#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44992#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:08:31,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {44992#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44993#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:08:31,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {44993#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44994#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:08:31,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {44994#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44995#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:08:31,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {44995#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44996#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:08:31,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {44996#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44997#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:08:31,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {44997#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:08:31,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:08:31,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {44999#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:08:31,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {44999#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {44972#false} is VALID
[2022-04-08 10:08:31,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {44972#false} assume !(~y~0 % 4294967296 > 0); {44972#false} is VALID
[2022-04-08 10:08:31,936 INFO L272 TraceCheckUtils]: 32: Hoare triple {44972#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44972#false} is VALID
[2022-04-08 10:08:31,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {44972#false} ~cond := #in~cond; {44972#false} is VALID
[2022-04-08 10:08:31,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {44972#false} assume 0 == ~cond; {44972#false} is VALID
[2022-04-08 10:08:31,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {44972#false} assume !false; {44972#false} is VALID
[2022-04-08 10:08:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:08:31,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:08:31,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994623777]
[2022-04-08 10:08:31,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994623777] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:08:31,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103679443]
[2022-04-08 10:08:31,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:08:31,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:31,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:08:31,938 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:08:31,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process
[2022-04-08 10:08:31,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:08:31,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:08:31,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 49 conjunts are in the unsatisfiable core
[2022-04-08 10:08:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:31,987 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:32,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {44971#true} call ULTIMATE.init(); {44971#true} is VALID
[2022-04-08 10:08:32,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {44971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44971#true} is VALID
[2022-04-08 10:08:32,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {44971#true} assume true; {44971#true} is VALID
[2022-04-08 10:08:32,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44971#true} {44971#true} #61#return; {44971#true} is VALID
[2022-04-08 10:08:32,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {44971#true} call #t~ret11 := main(); {44971#true} is VALID
[2022-04-08 10:08:32,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {44971#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44976#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:32,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {44976#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44977#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:32,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {44977#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:32,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {44978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44979#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:32,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {44979#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44980#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:32,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {44980#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:32,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {44981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44982#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:32,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {44982#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44983#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:32,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {44983#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44984#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:32,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {44984#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44985#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:32,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {44985#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44986#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:32,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {44986#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44987#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:08:32,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {44987#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44988#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:08:32,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {44988#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44989#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:08:32,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {44989#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44990#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:08:32,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {44990#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44991#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:08:32,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {44991#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44992#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:08:32,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {44992#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44993#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:08:32,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {44993#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44994#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:08:32,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {44994#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44995#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:08:32,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {44995#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44996#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:08:32,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {44996#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44997#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:08:32,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {44997#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:08:32,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:08:32,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {45091#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID
[2022-04-08 10:08:32,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {45091#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {44972#false} is VALID
[2022-04-08 10:08:32,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {44972#false} assume !(~y~0 % 4294967296 > 0); {44972#false} is VALID
[2022-04-08 10:08:32,328 INFO L272 TraceCheckUtils]: 32: Hoare triple {44972#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44972#false} is VALID
[2022-04-08 10:08:32,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {44972#false} ~cond := #in~cond; {44972#false} is VALID
[2022-04-08 10:08:32,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {44972#false} assume 0 == ~cond; {44972#false} is VALID
[2022-04-08 10:08:32,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {44972#false} assume !false; {44972#false} is VALID
[2022-04-08 10:08:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:08:32,329 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:33,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {44972#false} assume !false; {44972#false} is VALID
[2022-04-08 10:08:33,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {44972#false} assume 0 == ~cond; {44972#false} is VALID
[2022-04-08 10:08:33,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {44972#false} ~cond := #in~cond; {44972#false} is VALID
[2022-04-08 10:08:33,253 INFO L272 TraceCheckUtils]: 32: Hoare triple {44972#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44972#false} is VALID
[2022-04-08 10:08:33,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {44972#false} assume !(~y~0 % 4294967296 > 0); {44972#false} is VALID
[2022-04-08 10:08:33,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {45125#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {44972#false} is VALID
[2022-04-08 10:08:33,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {45129#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {45125#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:08:33,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {45129#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {45129#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:08:33,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {45136#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45129#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:08:33,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {45140#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45136#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:08:33,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {45144#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45140#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:08:33,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {45148#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45144#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:08:33,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {45152#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45148#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:08:33,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {45156#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45152#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:33,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {45160#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45156#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:08:33,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {45164#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45160#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:33,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {45168#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45164#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:08:33,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {45172#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45168#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:08:33,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {45176#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45172#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:08:33,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {45180#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45176#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:08:33,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {45184#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45180#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:08:33,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {45188#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45184#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:08:33,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {45192#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45188#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:08:33,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {45196#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45192#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:08:33,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {45200#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45196#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:08:33,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {45204#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45200#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:08:33,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {45208#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45204#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:08:33,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {45212#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45208#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:33,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {45216#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45212#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:08:33,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {45220#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45216#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID
[2022-04-08 10:08:33,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {44971#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45220#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID
[2022-04-08 10:08:33,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {44971#true} call #t~ret11 := main(); {44971#true} is VALID
[2022-04-08 10:08:33,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44971#true} {44971#true} #61#return; {44971#true} is VALID
[2022-04-08 10:08:33,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {44971#true} assume true; {44971#true} is VALID
[2022-04-08 10:08:33,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {44971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44971#true} is VALID
[2022-04-08 10:08:33,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {44971#true} call ULTIMATE.init(); {44971#true} is VALID
[2022-04-08 10:08:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:08:33,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103679443] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:33,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:33,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52
[2022-04-08 10:08:33,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:33,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [124709708]
[2022-04-08 10:08:33,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [124709708] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:33,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:33,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-04-08 10:08:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735662208]
[2022-04-08 10:08:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:33,270 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36
[2022-04-08 10:08:33,271 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:33,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:33,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:33,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-04-08 10:08:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-04-08 10:08:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652
[2022-04-08 10:08:33,292 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:37,445 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions.
[2022-04-08 10:08:37,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2022-04-08 10:08:37,446 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36
[2022-04-08 10:08:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:08:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 155 transitions.
[2022-04-08 10:08:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 155 transitions.
[2022-04-08 10:08:37,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 155 transitions.
[2022-04-08 10:08:37,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:37,574 INFO L225 Difference]: With dead ends: 147
[2022-04-08 10:08:37,574 INFO L226 Difference]: Without dead ends: 141
[2022-04-08 10:08:37,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1282, Invalid=4418, Unknown=0, NotChecked=0, Total=5700
[2022-04-08 10:08:37,574 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 132 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2022-04-08 10:08:37,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 176 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2022-04-08 10:08:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2022-04-08 10:08:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118.
[2022-04-08 10:08:37,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:08:37,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:37,708 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:37,709 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:37,710 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions.
[2022-04-08 10:08:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions.
[2022-04-08 10:08:37,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:37,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:37,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states.
[2022-04-08 10:08:37,710 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states.
[2022-04-08 10:08:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:37,711 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions.
[2022-04-08 10:08:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions.
[2022-04-08 10:08:37,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:37,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:37,712 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:08:37,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:08:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions.
[2022-04-08 10:08:37,713 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 36
[2022-04-08 10:08:37,713 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:08:37,713 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions.
[2022-04-08 10:08:37,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:37,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 150 transitions.
[2022-04-08 10:08:41,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 149 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions.
[2022-04-08 10:08:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-04-08 10:08:41,478 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:08:41,478 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:08:41,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0
[2022-04-08 10:08:41,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63
[2022-04-08 10:08:41,679 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:08:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:08:41,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1959952529, now seen corresponding path program 83 times
[2022-04-08 10:08:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:41,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2084722809]
[2022-04-08 10:08:41,682 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:08:41,682 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:08:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1959952529, now seen corresponding path program 84 times
[2022-04-08 10:08:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:08:41,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124049741]
[2022-04-08 10:08:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:08:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:08:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:41,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:08:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:41,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {46123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46101#true} is VALID
[2022-04-08 10:08:41,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {46101#true} assume true; {46101#true} is VALID
[2022-04-08 10:08:41,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46101#true} {46101#true} #61#return; {46101#true} is VALID
[2022-04-08 10:08:41,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {46101#true} call ULTIMATE.init(); {46123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:08:41,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {46123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46101#true} is VALID
[2022-04-08 10:08:41,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {46101#true} assume true; {46101#true} is VALID
[2022-04-08 10:08:41,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46101#true} {46101#true} #61#return; {46101#true} is VALID
[2022-04-08 10:08:41,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {46101#true} call #t~ret11 := main(); {46101#true} is VALID
[2022-04-08 10:08:41,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {46101#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46106#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:41,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {46106#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46107#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:41,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {46107#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46108#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:41,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {46108#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46109#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:41,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {46109#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46110#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:41,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {46110#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46111#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:41,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {46111#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46112#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:41,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {46112#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46113#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:41,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {46113#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:41,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:41,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {46115#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:08:41,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {46115#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46116#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:08:41,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {46116#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46117#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:08:41,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {46117#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46118#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:08:41,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {46118#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46119#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:08:41,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {46119#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46120#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:08:41,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {46120#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46121#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:08:41,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {46121#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46122#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:08:41,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {46122#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {46102#false} is VALID
[2022-04-08 10:08:41,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:41,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:41,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {46102#false} assume !(~y~0 % 4294967296 > 0); {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L272 TraceCheckUtils]: 33: Hoare triple {46102#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {46102#false} ~cond := #in~cond; {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {46102#false} assume 0 == ~cond; {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {46102#false} assume !false; {46102#false} is VALID
[2022-04-08 10:08:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:08:41,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:08:41,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124049741]
[2022-04-08 10:08:41,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124049741] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:08:41,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910516741]
[2022-04-08 10:08:41,970 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:08:41,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:41,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:08:41,971 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:08:41,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process
[2022-04-08 10:08:42,089 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-08 10:08:42,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:08:42,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 50 conjunts are in the unsatisfiable core
[2022-04-08 10:08:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:42,100 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:42,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {46101#true} call ULTIMATE.init(); {46101#true} is VALID
[2022-04-08 10:08:42,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {46101#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46101#true} is VALID
[2022-04-08 10:08:42,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {46101#true} assume true; {46101#true} is VALID
[2022-04-08 10:08:42,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46101#true} {46101#true} #61#return; {46101#true} is VALID
[2022-04-08 10:08:42,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {46101#true} call #t~ret11 := main(); {46101#true} is VALID
[2022-04-08 10:08:42,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {46101#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46106#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:42,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {46106#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46107#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:42,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {46107#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46108#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:42,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {46108#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46109#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:42,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {46109#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46110#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:42,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {46110#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46111#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:42,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {46111#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46112#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:42,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {46112#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46113#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:42,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {46113#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:42,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:42,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {46172#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:42,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {46172#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46176#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:08:42,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {46176#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46180#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:42,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {46180#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46184#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:42,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {46184#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46188#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:42,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {46188#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46192#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:42,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {46192#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46196#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:42,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {46196#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46200#(and (<= main_~y~0 8) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:42,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {46200#(and (<= main_~y~0 8) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {46102#false} assume !(~y~0 % 4294967296 > 0); {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L272 TraceCheckUtils]: 33: Hoare triple {46102#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {46102#false} ~cond := #in~cond; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {46102#false} assume 0 == ~cond; {46102#false} is VALID
[2022-04-08 10:08:42,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {46102#false} assume !false; {46102#false} is VALID
[2022-04-08 10:08:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:08:42,440 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:43,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {46102#false} assume !false; {46102#false} is VALID
[2022-04-08 10:08:43,008 INFO L290 TraceCheckUtils]: 35: Hoare triple {46102#false} assume 0 == ~cond; {46102#false} is VALID
[2022-04-08 10:08:43,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {46102#false} ~cond := #in~cond; {46102#false} is VALID
[2022-04-08 10:08:43,008 INFO L272 TraceCheckUtils]: 33: Hoare triple {46102#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46102#false} is VALID
[2022-04-08 10:08:43,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {46102#false} assume !(~y~0 % 4294967296 > 0); {46102#false} is VALID
[2022-04-08 10:08:43,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {46258#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID
[2022-04-08 10:08:43,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {46262#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46258#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:08:43,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {46266#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46262#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:08:43,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {46270#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46266#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:08:43,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {46274#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46270#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:08:43,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {46278#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46274#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:08:43,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {46282#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46278#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:08:43,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {46286#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46282#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:08:43,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {46290#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {46286#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:08:43,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {46294#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46290#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:08:43,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {46298#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46294#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:08:43,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {46302#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46298#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:08:43,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {46306#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46302#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:08:43,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {46310#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46306#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:08:43,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {46314#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46310#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:08:43,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {46318#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46314#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:08:43,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {46101#true} ~z~0 := ~y~0; {46318#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {46101#true} assume !(~x~0 % 4294967296 > 0); {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {46101#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {46101#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {46101#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {46101#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {46101#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {46101#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {46101#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {46101#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {46101#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {46101#true} call #t~ret11 := main(); {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46101#true} {46101#true} #61#return; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {46101#true} assume true; {46101#true} is VALID
[2022-04-08 10:08:43,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {46101#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46101#true} is VALID
[2022-04-08 10:08:43,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {46101#true} call ULTIMATE.init(); {46101#true} is VALID
[2022-04-08 10:08:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2022-04-08 10:08:43,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910516741] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:43,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:43,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 44
[2022-04-08 10:08:43,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:43,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2084722809]
[2022-04-08 10:08:43,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2084722809] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:43,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:43,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-04-08 10:08:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104881378]
[2022-04-08 10:08:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:43,023 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:08:43,023 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:43,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:43,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:43,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-04-08 10:08:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-04-08 10:08:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1645, Unknown=0, NotChecked=0, Total=1892
[2022-04-08 10:08:43,044 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:44,163 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions.
[2022-04-08 10:08:44,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-04-08 10:08:44,164 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:08:44,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:08:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions.
[2022-04-08 10:08:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions.
[2022-04-08 10:08:44,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 55 transitions.
[2022-04-08 10:08:44,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:44,207 INFO L225 Difference]: With dead ends: 143
[2022-04-08 10:08:44,207 INFO L226 Difference]: Without dead ends: 129
[2022-04-08 10:08:44,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=3241, Unknown=0, NotChecked=0, Total=3660
[2022-04-08 10:08:44,208 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:08:44,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 10:08:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2022-04-08 10:08:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119.
[2022-04-08 10:08:44,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:08:44,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:44,348 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:44,348 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:44,349 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions.
[2022-04-08 10:08:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions.
[2022-04-08 10:08:44,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:44,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:44,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states.
[2022-04-08 10:08:44,350 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states.
[2022-04-08 10:08:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:44,351 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions.
[2022-04-08 10:08:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions.
[2022-04-08 10:08:44,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:44,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:44,351 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:08:44,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:08:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions.
[2022-04-08 10:08:44,353 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 37
[2022-04-08 10:08:44,353 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:08:44,353 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions.
[2022-04-08 10:08:44,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:44,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 151 transitions.
[2022-04-08 10:08:48,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions.
[2022-04-08 10:08:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-04-08 10:08:48,126 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:08:48,126 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:08:48,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0
[2022-04-08 10:08:48,330 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:48,330 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:08:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:08:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1268390207, now seen corresponding path program 85 times
[2022-04-08 10:08:48,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:48,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431174305]
[2022-04-08 10:08:48,332 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:08:48,332 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:08:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1268390207, now seen corresponding path program 86 times
[2022-04-08 10:08:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:08:48,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480351162]
[2022-04-08 10:08:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:08:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:08:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:08:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:48,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {47206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47185#true} is VALID
[2022-04-08 10:08:48,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {47185#true} assume true; {47185#true} is VALID
[2022-04-08 10:08:48,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47185#true} {47185#true} #61#return; {47185#true} is VALID
[2022-04-08 10:08:48,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {47185#true} call ULTIMATE.init(); {47206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:08:48,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {47206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47185#true} is VALID
[2022-04-08 10:08:48,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {47185#true} assume true; {47185#true} is VALID
[2022-04-08 10:08:48,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47185#true} {47185#true} #61#return; {47185#true} is VALID
[2022-04-08 10:08:48,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {47185#true} call #t~ret11 := main(); {47185#true} is VALID
[2022-04-08 10:08:48,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {47185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47190#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:48,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {47190#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:48,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {47191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:48,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {47192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:48,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {47193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:48,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {47194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:48,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {47195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:48,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {47196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:48,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {47197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:48,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {47198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:48,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:48,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {47200#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:08:48,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {47200#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47201#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:08:48,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {47201#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47202#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:08:48,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {47202#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47203#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:08:48,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {47203#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47204#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:08:48,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {47204#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47205#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:08:48,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {47205#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {47186#false} is VALID
[2022-04-08 10:08:48,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {47186#false} assume !(~y~0 % 4294967296 > 0); {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L272 TraceCheckUtils]: 33: Hoare triple {47186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {47186#false} ~cond := #in~cond; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {47186#false} assume 0 == ~cond; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {47186#false} assume !false; {47186#false} is VALID
[2022-04-08 10:08:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:08:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:08:48,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480351162]
[2022-04-08 10:08:48,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480351162] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:08:48,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920259762]
[2022-04-08 10:08:48,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:08:48,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:48,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:08:48,615 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:08:48,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process
[2022-04-08 10:08:48,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:08:48,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:08:48,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 33 conjunts are in the unsatisfiable core
[2022-04-08 10:08:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:48,673 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:48,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {47185#true} call ULTIMATE.init(); {47185#true} is VALID
[2022-04-08 10:08:48,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {47185#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47185#true} is VALID
[2022-04-08 10:08:48,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {47185#true} assume true; {47185#true} is VALID
[2022-04-08 10:08:48,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47185#true} {47185#true} #61#return; {47185#true} is VALID
[2022-04-08 10:08:48,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {47185#true} call #t~ret11 := main(); {47185#true} is VALID
[2022-04-08 10:08:48,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {47185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47190#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:48,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {47190#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:48,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {47191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:48,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {47192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:48,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {47193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:48,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {47194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:48,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {47195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:48,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {47196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:48,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {47197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:48,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {47198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:48,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:48,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {47200#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:08:48,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {47200#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47201#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:08:48,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {47201#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47202#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:08:48,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {47202#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47203#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:08:48,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {47203#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47204#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:08:48,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {47204#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47273#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:08:48,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {47273#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {47186#false} is VALID
[2022-04-08 10:08:48,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {47186#false} assume !(~y~0 % 4294967296 > 0); {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L272 TraceCheckUtils]: 33: Hoare triple {47186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {47186#false} ~cond := #in~cond; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {47186#false} assume 0 == ~cond; {47186#false} is VALID
[2022-04-08 10:08:48,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {47186#false} assume !false; {47186#false} is VALID
[2022-04-08 10:08:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:08:48,950 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:49,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {47186#false} assume !false; {47186#false} is VALID
[2022-04-08 10:08:49,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {47186#false} assume 0 == ~cond; {47186#false} is VALID
[2022-04-08 10:08:49,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {47186#false} ~cond := #in~cond; {47186#false} is VALID
[2022-04-08 10:08:49,427 INFO L272 TraceCheckUtils]: 33: Hoare triple {47186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47186#false} is VALID
[2022-04-08 10:08:49,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {47186#false} assume !(~y~0 % 4294967296 > 0); {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID
[2022-04-08 10:08:49,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {47361#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47186#false} is VALID
[2022-04-08 10:08:49,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {47365#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47361#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:08:49,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {47369#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47365#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:49,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {47373#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47369#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:08:49,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {47377#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47373#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:08:49,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {47381#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47377#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:08:49,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {47385#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {47381#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:08:49,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {47385#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47385#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:49,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {47392#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47385#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:49,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {47396#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47392#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:49,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {47400#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47396#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:08:49,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {47404#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47400#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:08:49,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {47408#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47404#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:49,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {47412#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47408#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:08:49,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {47416#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47412#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:08:49,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {47420#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47416#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:08:49,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {47424#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47420#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:08:49,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {47185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47424#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:08:49,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {47185#true} call #t~ret11 := main(); {47185#true} is VALID
[2022-04-08 10:08:49,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47185#true} {47185#true} #61#return; {47185#true} is VALID
[2022-04-08 10:08:49,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {47185#true} assume true; {47185#true} is VALID
[2022-04-08 10:08:49,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {47185#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47185#true} is VALID
[2022-04-08 10:08:49,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {47185#true} call ULTIMATE.init(); {47185#true} is VALID
[2022-04-08 10:08:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:08:49,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920259762] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:49,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:49,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36
[2022-04-08 10:08:49,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:49,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431174305]
[2022-04-08 10:08:49,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431174305] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:49,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:49,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2022-04-08 10:08:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599260776]
[2022-04-08 10:08:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:08:49,441 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:49,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:49,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:49,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-08 10:08:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-08 10:08:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260
[2022-04-08 10:08:49,463 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:50,975 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions.
[2022-04-08 10:08:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2022-04-08 10:08:50,975 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:08:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:08:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions.
[2022-04-08 10:08:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions.
[2022-04-08 10:08:50,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 64 transitions.
[2022-04-08 10:08:51,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:51,025 INFO L225 Difference]: With dead ends: 146
[2022-04-08 10:08:51,025 INFO L226 Difference]: Without dead ends: 131
[2022-04-08 10:08:51,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=2597, Unknown=0, NotChecked=0, Total=3192
[2022-04-08 10:08:51,026 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:08:51,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:08:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2022-04-08 10:08:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120.
[2022-04-08 10:08:51,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:08:51,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:51,158 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:51,159 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:51,160 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions.
[2022-04-08 10:08:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions.
[2022-04-08 10:08:51,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:51,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:51,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states.
[2022-04-08 10:08:51,160 INFO L87 Difference]: Start difference. First operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states.
[2022-04-08 10:08:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:51,161 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions.
[2022-04-08 10:08:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions.
[2022-04-08 10:08:51,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:51,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:51,161 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:08:51,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:08:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions.
[2022-04-08 10:08:51,163 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 37
[2022-04-08 10:08:51,163 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:08:51,163 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions.
[2022-04-08 10:08:51,163 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:51,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 152 transitions.
[2022-04-08 10:08:55,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 151 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions.
[2022-04-08 10:08:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-04-08 10:08:55,382 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:08:55,382 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:08:55,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0
[2022-04-08 10:08:55,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65
[2022-04-08 10:08:55,582 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:08:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:08:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1252004433, now seen corresponding path program 87 times
[2022-04-08 10:08:55,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:55,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1182919272]
[2022-04-08 10:08:55,585 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:08:55,585 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:08:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1252004433, now seen corresponding path program 88 times
[2022-04-08 10:08:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:08:55,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428195065]
[2022-04-08 10:08:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:08:55,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:08:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:55,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:08:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:55,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {48301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48281#true} is VALID
[2022-04-08 10:08:55,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {48281#true} assume true; {48281#true} is VALID
[2022-04-08 10:08:55,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48281#true} {48281#true} #61#return; {48281#true} is VALID
[2022-04-08 10:08:55,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {48281#true} call ULTIMATE.init(); {48301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:08:55,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {48301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48281#true} is VALID
[2022-04-08 10:08:55,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {48281#true} assume true; {48281#true} is VALID
[2022-04-08 10:08:55,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48281#true} {48281#true} #61#return; {48281#true} is VALID
[2022-04-08 10:08:55,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {48281#true} call #t~ret11 := main(); {48281#true} is VALID
[2022-04-08 10:08:55,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {48281#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48286#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:55,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {48286#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48287#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:55,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {48287#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48288#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:55,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {48288#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48289#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:55,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {48289#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48290#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:55,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {48290#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48291#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:55,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {48291#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48292#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:55,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {48292#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48293#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:55,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {48293#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48294#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:55,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {48294#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48295#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:55,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {48295#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:55,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:55,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {48297#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:08:55,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {48297#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48298#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:08:55,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {48298#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48299#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:08:55,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {48299#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48300#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {48300#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {48282#false} assume !(~y~0 % 4294967296 > 0); {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L272 TraceCheckUtils]: 33: Hoare triple {48282#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {48282#false} ~cond := #in~cond; {48282#false} is VALID
[2022-04-08 10:08:55,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {48282#false} assume 0 == ~cond; {48282#false} is VALID
[2022-04-08 10:08:55,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {48282#false} assume !false; {48282#false} is VALID
[2022-04-08 10:08:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:08:55,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:08:55,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428195065]
[2022-04-08 10:08:55,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428195065] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:08:55,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148012039]
[2022-04-08 10:08:55,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:08:55,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:55,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:08:55,815 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:08:55,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process
[2022-04-08 10:08:55,855 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:08:55,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:08:55,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 31 conjunts are in the unsatisfiable core
[2022-04-08 10:08:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:55,864 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:56,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {48281#true} call ULTIMATE.init(); {48281#true} is VALID
[2022-04-08 10:08:56,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {48281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48281#true} is VALID
[2022-04-08 10:08:56,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {48281#true} assume true; {48281#true} is VALID
[2022-04-08 10:08:56,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48281#true} {48281#true} #61#return; {48281#true} is VALID
[2022-04-08 10:08:56,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {48281#true} call #t~ret11 := main(); {48281#true} is VALID
[2022-04-08 10:08:56,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {48281#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48286#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:56,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {48286#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48287#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:56,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {48287#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48288#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:56,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {48288#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48289#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:56,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {48289#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48290#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:56,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {48290#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48291#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:56,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {48291#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48292#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:56,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {48292#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48293#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:56,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {48293#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48294#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:56,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {48294#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48295#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:56,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {48295#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:56,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:56,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {48297#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:08:56,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {48297#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48298#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:08:56,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {48298#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48299#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:08:56,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {48299#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48365#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:08:56,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {48365#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48282#false} is VALID
[2022-04-08 10:08:56,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {48282#false} assume !(~y~0 % 4294967296 > 0); {48282#false} is VALID
[2022-04-08 10:08:56,116 INFO L272 TraceCheckUtils]: 33: Hoare triple {48282#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48282#false} is VALID
[2022-04-08 10:08:56,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {48282#false} ~cond := #in~cond; {48282#false} is VALID
[2022-04-08 10:08:56,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {48282#false} assume 0 == ~cond; {48282#false} is VALID
[2022-04-08 10:08:56,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {48282#false} assume !false; {48282#false} is VALID
[2022-04-08 10:08:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:08:56,116 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:56,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {48282#false} assume !false; {48282#false} is VALID
[2022-04-08 10:08:56,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {48282#false} assume 0 == ~cond; {48282#false} is VALID
[2022-04-08 10:08:56,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {48282#false} ~cond := #in~cond; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L272 TraceCheckUtils]: 33: Hoare triple {48282#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {48282#false} assume !(~y~0 % 4294967296 > 0); {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID
[2022-04-08 10:08:56,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {48459#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48282#false} is VALID
[2022-04-08 10:08:56,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {48463#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48459#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:08:56,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {48467#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48463#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:56,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {48471#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48467#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:08:56,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {48475#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {48471#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:08:56,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {48475#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48475#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:08:56,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {48482#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48475#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:08:56,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {48486#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48482#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:08:56,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {48490#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48486#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:08:56,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {48494#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48490#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:08:56,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {48498#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48494#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:08:56,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {48502#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48498#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:08:56,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {48506#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48502#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:08:56,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {48510#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48506#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:08:56,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {48514#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48510#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:56,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {48518#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48514#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:08:56,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {48281#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48518#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:08:56,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {48281#true} call #t~ret11 := main(); {48281#true} is VALID
[2022-04-08 10:08:56,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48281#true} {48281#true} #61#return; {48281#true} is VALID
[2022-04-08 10:08:56,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {48281#true} assume true; {48281#true} is VALID
[2022-04-08 10:08:56,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {48281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48281#true} is VALID
[2022-04-08 10:08:56,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {48281#true} call ULTIMATE.init(); {48281#true} is VALID
[2022-04-08 10:08:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:08:56,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148012039] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:56,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:56,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34
[2022-04-08 10:08:56,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:56,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1182919272]
[2022-04-08 10:08:56,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1182919272] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:56,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:56,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-04-08 10:08:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116936666]
[2022-04-08 10:08:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:56,537 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:08:56,537 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:56,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:56,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:56,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-04-08 10:08:56,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:56,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-04-08 10:08:56,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122
[2022-04-08 10:08:56,556 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:57,824 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions.
[2022-04-08 10:08:57,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2022-04-08 10:08:57,824 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:08:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:08:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 68 transitions.
[2022-04-08 10:08:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 68 transitions.
[2022-04-08 10:08:57,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 68 transitions.
[2022-04-08 10:08:57,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:57,878 INFO L225 Difference]: With dead ends: 149
[2022-04-08 10:08:57,878 INFO L226 Difference]: Without dead ends: 133
[2022-04-08 10:08:57,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=568, Invalid=2294, Unknown=0, NotChecked=0, Total=2862
[2022-04-08 10:08:57,879 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:08:57,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 82 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:08:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2022-04-08 10:08:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121.
[2022-04-08 10:08:58,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:08:58,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:58,013 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:58,013 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:58,014 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions.
[2022-04-08 10:08:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions.
[2022-04-08 10:08:58,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:58,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:58,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states.
[2022-04-08 10:08:58,014 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states.
[2022-04-08 10:08:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:08:58,015 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions.
[2022-04-08 10:08:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions.
[2022-04-08 10:08:58,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:08:58,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:08:58,016 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:08:58,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:08:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions.
[2022-04-08 10:08:58,017 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 37
[2022-04-08 10:08:58,017 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:08:58,017 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions.
[2022-04-08 10:08:58,017 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:58,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 153 transitions.
[2022-04-08 10:08:59,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions.
[2022-04-08 10:08:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-04-08 10:08:59,067 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:08:59,067 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:08:59,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0
[2022-04-08 10:08:59,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66
[2022-04-08 10:08:59,271 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:08:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:08:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash -119674113, now seen corresponding path program 89 times
[2022-04-08 10:08:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:59,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1224830098]
[2022-04-08 10:08:59,274 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:08:59,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:08:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash -119674113, now seen corresponding path program 90 times
[2022-04-08 10:08:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:08:59,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913800270]
[2022-04-08 10:08:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:08:59,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:08:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:08:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:59,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {49404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49385#true} is VALID
[2022-04-08 10:08:59,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {49385#true} assume true; {49385#true} is VALID
[2022-04-08 10:08:59,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49385#true} {49385#true} #61#return; {49385#true} is VALID
[2022-04-08 10:08:59,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {49385#true} call ULTIMATE.init(); {49404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:08:59,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {49404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49385#true} is VALID
[2022-04-08 10:08:59,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {49385#true} assume true; {49385#true} is VALID
[2022-04-08 10:08:59,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49385#true} {49385#true} #61#return; {49385#true} is VALID
[2022-04-08 10:08:59,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {49385#true} call #t~ret11 := main(); {49385#true} is VALID
[2022-04-08 10:08:59,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {49385#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49390#(= main_~y~0 0)} is VALID
[2022-04-08 10:08:59,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {49390#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49391#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:08:59,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {49391#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49392#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:08:59,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {49392#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49393#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:08:59,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {49393#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49394#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:08:59,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {49394#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49395#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:08:59,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {49395#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49396#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:08:59,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {49396#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49397#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:08:59,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {49397#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49398#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:08:59,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {49398#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49399#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:08:59,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {49399#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49400#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:08:59,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {49400#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49401#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:08:59,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {49401#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {49401#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:08:59,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {49401#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {49402#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:08:59,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {49402#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49403#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:08:59,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {49403#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {49386#false} is VALID
[2022-04-08 10:08:59,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {49386#false} assume !(~y~0 % 4294967296 > 0); {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L272 TraceCheckUtils]: 33: Hoare triple {49386#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {49386#false} ~cond := #in~cond; {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {49386#false} assume 0 == ~cond; {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {49386#false} assume !false; {49386#false} is VALID
[2022-04-08 10:08:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:08:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:08:59,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913800270]
[2022-04-08 10:08:59,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913800270] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:08:59,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639038193]
[2022-04-08 10:08:59,497 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:08:59,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:08:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:08:59,497 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:08:59,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process
[2022-04-08 10:08:59,552 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2022-04-08 10:08:59,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:08:59,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core
[2022-04-08 10:08:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:08:59,562 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:08:59,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {49385#true} call ULTIMATE.init(); {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {49385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {49385#true} assume true; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49385#true} {49385#true} #61#return; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {49385#true} call #t~ret11 := main(); {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {49385#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {49385#true} assume !(~x~0 % 4294967296 > 0); {49385#true} is VALID
[2022-04-08 10:08:59,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {49385#true} ~z~0 := ~y~0; {49462#(= main_~z~0 main_~y~0)} is VALID
[2022-04-08 10:08:59,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {49462#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49466#(= main_~y~0 (+ main_~z~0 1))} is VALID
[2022-04-08 10:08:59,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {49466#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {49470#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:08:59,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {49470#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49474#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:08:59,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {49474#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {49386#false} assume !(~y~0 % 4294967296 > 0); {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L272 TraceCheckUtils]: 33: Hoare triple {49386#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {49386#false} ~cond := #in~cond; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {49386#false} assume 0 == ~cond; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {49386#false} assume !false; {49386#false} is VALID
[2022-04-08 10:08:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2022-04-08 10:08:59,682 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:08:59,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {49386#false} assume !false; {49386#false} is VALID
[2022-04-08 10:08:59,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {49386#false} assume 0 == ~cond; {49386#false} is VALID
[2022-04-08 10:08:59,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {49386#false} ~cond := #in~cond; {49386#false} is VALID
[2022-04-08 10:08:59,806 INFO L272 TraceCheckUtils]: 33: Hoare triple {49386#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49386#false} is VALID
[2022-04-08 10:08:59,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {49386#false} assume !(~y~0 % 4294967296 > 0); {49386#false} is VALID
[2022-04-08 10:08:59,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {49474#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID
[2022-04-08 10:08:59,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {49470#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49474#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:08:59,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {49568#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {49470#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:08:59,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {49572#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49568#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {49385#true} ~z~0 := ~y~0; {49572#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {49385#true} assume !(~x~0 % 4294967296 > 0); {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {49385#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49385#true} is VALID
[2022-04-08 10:08:59,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {49385#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49385#true} is VALID
[2022-04-08 10:08:59,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {49385#true} call #t~ret11 := main(); {49385#true} is VALID
[2022-04-08 10:08:59,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49385#true} {49385#true} #61#return; {49385#true} is VALID
[2022-04-08 10:08:59,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {49385#true} assume true; {49385#true} is VALID
[2022-04-08 10:08:59,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {49385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49385#true} is VALID
[2022-04-08 10:08:59,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {49385#true} call ULTIMATE.init(); {49385#true} is VALID
[2022-04-08 10:08:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2022-04-08 10:08:59,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639038193] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:08:59,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:08:59,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 23
[2022-04-08 10:08:59,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:08:59,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1224830098]
[2022-04-08 10:08:59,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1224830098] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:08:59,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:08:59,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-04-08 10:08:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790750879]
[2022-04-08 10:08:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:08:59,812 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:08:59,812 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:08:59,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:08:59,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:08:59,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-04-08 10:08:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:08:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-04-08 10:08:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506
[2022-04-08 10:08:59,829 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:01,074 INFO L93 Difference]: Finished difference Result 152 states and 184 transitions.
[2022-04-08 10:09:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2022-04-08 10:09:01,074 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:09:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:09:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions.
[2022-04-08 10:09:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions.
[2022-04-08 10:09:01,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 68 transitions.
[2022-04-08 10:09:01,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:01,130 INFO L225 Difference]: With dead ends: 152
[2022-04-08 10:09:01,130 INFO L226 Difference]: Without dead ends: 135
[2022-04-08 10:09:01,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406
[2022-04-08 10:09:01,130 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:09:01,130 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 89 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:09:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states.
[2022-04-08 10:09:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122.
[2022-04-08 10:09:01,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:09:01,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:01,262 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:01,262 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:01,263 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions.
[2022-04-08 10:09:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions.
[2022-04-08 10:09:01,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:09:01,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:09:01,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states.
[2022-04-08 10:09:01,264 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states.
[2022-04-08 10:09:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:01,265 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions.
[2022-04-08 10:09:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions.
[2022-04-08 10:09:01,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:09:01,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:09:01,265 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:09:01,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:09:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions.
[2022-04-08 10:09:01,267 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 154 transitions. Word has length 37
[2022-04-08 10:09:01,267 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:09:01,267 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 154 transitions.
[2022-04-08 10:09:01,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:01,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 154 transitions.
[2022-04-08 10:09:02,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions.
[2022-04-08 10:09:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-04-08 10:09:02,603 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:09:02,603 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:09:02,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0
[2022-04-08 10:09:02,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67
[2022-04-08 10:09:02,804 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:09:02,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:09:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1023324338, now seen corresponding path program 45 times
[2022-04-08 10:09:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:09:02,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436153376]
[2022-04-08 10:09:02,806 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:09:02,806 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:09:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1023324338, now seen corresponding path program 46 times
[2022-04-08 10:09:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:09:02,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221340168]
[2022-04-08 10:09:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:09:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:09:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:09:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:09:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:09:03,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {50510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50480#true} is VALID
[2022-04-08 10:09:03,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {50480#true} assume true; {50480#true} is VALID
[2022-04-08 10:09:03,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50480#true} {50480#true} #61#return; {50480#true} is VALID
[2022-04-08 10:09:03,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {50480#true} call ULTIMATE.init(); {50510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:09:03,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {50510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50480#true} is VALID
[2022-04-08 10:09:03,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {50480#true} assume true; {50480#true} is VALID
[2022-04-08 10:09:03,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50480#true} {50480#true} #61#return; {50480#true} is VALID
[2022-04-08 10:09:03,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {50480#true} call #t~ret11 := main(); {50480#true} is VALID
[2022-04-08 10:09:03,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {50480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50485#(= main_~y~0 0)} is VALID
[2022-04-08 10:09:03,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {50485#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:09:03,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {50486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:09:03,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {50487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:09:03,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {50488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:09:03,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {50489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:09:03,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {50490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:09:03,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {50491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:09:03,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {50492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:09:03,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {50493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:03,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {50494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:09:03,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {50495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:09:03,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {50496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:09:03,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {50497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50498#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:09:03,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {50498#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50499#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:09:03,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {50499#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50500#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:09:03,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {50500#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50501#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:09:03,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {50501#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50502#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:09:03,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {50502#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50503#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:09:03,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {50503#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50504#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:09:03,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {50504#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50505#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:09:03,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {50505#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50506#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:09:03,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {50506#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50507#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:09:03,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {50507#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:09:03,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:09:03,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {50509#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID
[2022-04-08 10:09:03,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {50509#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {50481#false} is VALID
[2022-04-08 10:09:03,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {50481#false} assume !(~y~0 % 4294967296 > 0); {50481#false} is VALID
[2022-04-08 10:09:03,256 INFO L272 TraceCheckUtils]: 33: Hoare triple {50481#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50481#false} is VALID
[2022-04-08 10:09:03,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {50481#false} ~cond := #in~cond; {50481#false} is VALID
[2022-04-08 10:09:03,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {50481#false} assume 0 == ~cond; {50481#false} is VALID
[2022-04-08 10:09:03,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {50481#false} assume !false; {50481#false} is VALID
[2022-04-08 10:09:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:09:03,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:09:03,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221340168]
[2022-04-08 10:09:03,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221340168] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:09:03,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081504982]
[2022-04-08 10:09:03,257 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:09:03,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:09:03,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:09:03,257 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:09:03,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process
[2022-04-08 10:09:03,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:09:03,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:09:03,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 51 conjunts are in the unsatisfiable core
[2022-04-08 10:09:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:09:03,307 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:09:03,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {50480#true} call ULTIMATE.init(); {50480#true} is VALID
[2022-04-08 10:09:03,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {50480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50480#true} is VALID
[2022-04-08 10:09:03,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {50480#true} assume true; {50480#true} is VALID
[2022-04-08 10:09:03,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50480#true} {50480#true} #61#return; {50480#true} is VALID
[2022-04-08 10:09:03,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {50480#true} call #t~ret11 := main(); {50480#true} is VALID
[2022-04-08 10:09:03,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {50480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50485#(= main_~y~0 0)} is VALID
[2022-04-08 10:09:03,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {50485#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:09:03,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {50486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:09:03,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {50487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:09:03,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {50488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:09:03,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {50489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:09:03,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {50490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:09:03,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {50491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:09:03,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {50492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:09:03,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {50493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:03,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {50494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:09:03,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {50495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:09:03,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {50496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:09:03,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {50497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50498#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:09:03,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {50498#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50499#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:09:03,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {50499#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50500#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:09:03,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {50500#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50501#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:09:03,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {50501#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50502#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:09:03,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {50502#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50503#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:09:03,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {50503#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50504#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:09:03,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {50504#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50505#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:09:03,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {50505#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50506#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:09:03,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {50506#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50507#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:09:03,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {50507#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:09:03,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:09:03,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {50604#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID
[2022-04-08 10:09:03,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {50604#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 > 0); {50481#false} is VALID
[2022-04-08 10:09:03,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {50481#false} assume !(~y~0 % 4294967296 > 0); {50481#false} is VALID
[2022-04-08 10:09:03,647 INFO L272 TraceCheckUtils]: 33: Hoare triple {50481#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50481#false} is VALID
[2022-04-08 10:09:03,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {50481#false} ~cond := #in~cond; {50481#false} is VALID
[2022-04-08 10:09:03,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {50481#false} assume 0 == ~cond; {50481#false} is VALID
[2022-04-08 10:09:03,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {50481#false} assume !false; {50481#false} is VALID
[2022-04-08 10:09:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:09:03,648 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:09:04,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {50481#false} assume !false; {50481#false} is VALID
[2022-04-08 10:09:04,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {50481#false} assume 0 == ~cond; {50481#false} is VALID
[2022-04-08 10:09:04,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {50481#false} ~cond := #in~cond; {50481#false} is VALID
[2022-04-08 10:09:04,646 INFO L272 TraceCheckUtils]: 33: Hoare triple {50481#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50481#false} is VALID
[2022-04-08 10:09:04,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {50481#false} assume !(~y~0 % 4294967296 > 0); {50481#false} is VALID
[2022-04-08 10:09:04,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {50638#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {50481#false} is VALID
[2022-04-08 10:09:04,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {50642#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {50638#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:09:04,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {50642#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {50642#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:09:04,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {50649#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50642#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:09:04,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {50653#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50649#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:09:04,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {50657#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50653#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:09:04,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {50661#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50657#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:09:04,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {50665#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50661#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:09:04,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {50669#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50665#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:09:04,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {50673#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50669#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:09:04,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {50677#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50673#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:09:04,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {50681#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50677#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:09:04,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {50685#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50681#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:09:04,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {50689#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50685#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:09:04,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {50693#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50689#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:09:04,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {50697#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50693#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:09:04,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {50701#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50697#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:09:04,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {50705#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50701#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:09:04,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {50709#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50705#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:09:04,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {50713#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50709#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:09:04,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {50717#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50713#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:09:04,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {50721#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50717#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:09:04,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {50725#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50721#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:09:04,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {50729#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50725#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:09:04,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {50733#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50729#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID
[2022-04-08 10:09:04,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {50737#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50733#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID
[2022-04-08 10:09:04,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {50480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50737#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:09:04,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {50480#true} call #t~ret11 := main(); {50480#true} is VALID
[2022-04-08 10:09:04,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50480#true} {50480#true} #61#return; {50480#true} is VALID
[2022-04-08 10:09:04,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {50480#true} assume true; {50480#true} is VALID
[2022-04-08 10:09:04,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {50480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {50480#true} is VALID
[2022-04-08 10:09:04,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {50480#true} call ULTIMATE.init(); {50480#true} is VALID
[2022-04-08 10:09:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:09:04,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081504982] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:09:04,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:09:04,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54
[2022-04-08 10:09:04,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:09:04,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436153376]
[2022-04-08 10:09:04,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436153376] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:09:04,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:09:04,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28
[2022-04-08 10:09:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619721885]
[2022-04-08 10:09:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:09:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:09:04,664 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:09:04,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:04,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:04,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2022-04-08 10:09:04,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:09:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2022-04-08 10:09:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862
[2022-04-08 10:09:04,685 INFO L87 Difference]: Start difference. First operand 122 states and 154 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:09,281 INFO L93 Difference]: Finished difference Result 157 states and 216 transitions.
[2022-04-08 10:09:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2022-04-08 10:09:09,281 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37
[2022-04-08 10:09:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:09:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 162 transitions.
[2022-04-08 10:09:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 162 transitions.
[2022-04-08 10:09:09,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 162 transitions.
[2022-04-08 10:09:09,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:09,417 INFO L225 Difference]: With dead ends: 157
[2022-04-08 10:09:09,417 INFO L226 Difference]: Without dead ends: 151
[2022-04-08 10:09:09,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1385, Invalid=4777, Unknown=0, NotChecked=0, Total=6162
[2022-04-08 10:09:09,418 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2879 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2022-04-08 10:09:09,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 184 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2879 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2022-04-08 10:09:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2022-04-08 10:09:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127.
[2022-04-08 10:09:09,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:09:09,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:09,569 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:09,569 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:09,571 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions.
[2022-04-08 10:09:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions.
[2022-04-08 10:09:09,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:09:09,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:09:09,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states.
[2022-04-08 10:09:09,571 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states.
[2022-04-08 10:09:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:09,573 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions.
[2022-04-08 10:09:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions.
[2022-04-08 10:09:09,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:09:09,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:09:09,573 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:09:09,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:09:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions.
[2022-04-08 10:09:09,574 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 37
[2022-04-08 10:09:09,574 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:09:09,574 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions.
[2022-04-08 10:09:09,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:09,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 161 transitions.
[2022-04-08 10:09:12,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 160 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions.
[2022-04-08 10:09:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2022-04-08 10:09:12,117 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:09:12,117 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:09:12,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0
[2022-04-08 10:09:12,317 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68
[2022-04-08 10:09:12,317 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:09:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:09:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 91 times
[2022-04-08 10:09:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:09:12,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372145778]
[2022-04-08 10:09:12,320 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:09:12,320 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:09:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 92 times
[2022-04-08 10:09:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:09:12,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808497582]
[2022-04-08 10:09:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:09:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:09:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:09:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:09:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:09:13,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {51705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51678#true} is VALID
[2022-04-08 10:09:13,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {51678#true} assume true; {51678#true} is VALID
[2022-04-08 10:09:13,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51678#true} {51678#true} #61#return; {51678#true} is VALID
[2022-04-08 10:09:13,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {51678#true} call ULTIMATE.init(); {51705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:09:13,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {51705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51678#true} is VALID
[2022-04-08 10:09:13,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {51678#true} assume true; {51678#true} is VALID
[2022-04-08 10:09:13,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51678#true} {51678#true} #61#return; {51678#true} is VALID
[2022-04-08 10:09:13,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {51678#true} call #t~ret11 := main(); {51678#true} is VALID
[2022-04-08 10:09:13,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {51678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51683#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:09:13,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {51683#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51684#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:09:13,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {51684#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51685#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:09:13,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {51685#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51686#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:13,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {51686#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51687#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:09:13,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {51687#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51688#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:13,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {51688#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51689#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID
[2022-04-08 10:09:13,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {51689#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51690#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:09:13,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {51690#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51691#(and (<= main_~y~0 8) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 8 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {51691#(and (<= main_~y~0 8) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 8 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 8) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {51692#(and (<= main_~y~0 8) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {51692#(and (<= main_~y~0 8) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 8) main_~n~0))} ~z~0 := ~y~0; {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:09:13,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:09:13,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:13,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:13,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:13,198 INFO L272 TraceCheckUtils]: 34: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51703#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:09:13,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {51703#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {51704#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:09:13,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {51704#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {51679#false} is VALID
[2022-04-08 10:09:13,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {51679#false} assume !false; {51679#false} is VALID
[2022-04-08 10:09:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:09:13,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:09:13,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808497582]
[2022-04-08 10:09:13,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808497582] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:09:13,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675583988]
[2022-04-08 10:09:13,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:09:13,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:09:13,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:09:13,200 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:09:13,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process
[2022-04-08 10:09:13,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:09:13,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:09:13,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 76 conjunts are in the unsatisfiable core
[2022-04-08 10:09:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:09:13,535 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:09:39,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {51678#true} call ULTIMATE.init(); {51678#true} is VALID
[2022-04-08 10:09:39,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {51678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51678#true} is VALID
[2022-04-08 10:09:39,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {51678#true} assume true; {51678#true} is VALID
[2022-04-08 10:09:39,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51678#true} {51678#true} #61#return; {51678#true} is VALID
[2022-04-08 10:09:39,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {51678#true} call #t~ret11 := main(); {51678#true} is VALID
[2022-04-08 10:09:39,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {51678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51683#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:09:39,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {51683#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51727#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID
[2022-04-08 10:09:39,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {51727#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51731#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID
[2022-04-08 10:09:39,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {51731#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51735#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} is VALID
[2022-04-08 10:09:39,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {51735#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51739#(and (= main_~y~0 4) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:09:39,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {51739#(and (= main_~y~0 4) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51743#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= 5 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:09:39,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {51743#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= 5 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51747#(and (= main_~y~0 6) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:09:39,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {51747#(and (= main_~y~0 6) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51751#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (= 7 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:09:39,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {51751#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (= 7 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51755#(and (= (+ main_~n~0 (- 6)) (+ main_~x~0 2)) (= 7 (+ (- 1) main_~y~0)) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:09:39,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {51755#(and (= (+ main_~n~0 (- 6)) (+ main_~x~0 2)) (= 7 (+ (- 1) main_~y~0)) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {51692#(and (<= main_~y~0 8) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {51692#(and (<= main_~y~0 8) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 8) main_~n~0))} ~z~0 := ~y~0; {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:09:39,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:09:39,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} is VALID
[2022-04-08 10:09:39,316 INFO L272 TraceCheckUtils]: 34: Hoare triple {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51819#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:09:39,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {51819#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {51823#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:09:39,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {51823#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {51679#false} is VALID
[2022-04-08 10:09:39,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {51679#false} assume !false; {51679#false} is VALID
[2022-04-08 10:09:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:09:39,317 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:09:43,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {51679#false} assume !false; {51679#false} is VALID
[2022-04-08 10:09:43,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {51823#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {51679#false} is VALID
[2022-04-08 10:09:43,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {51819#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {51823#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:09:43,374 INFO L272 TraceCheckUtils]: 34: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51819#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:09:43,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {51845#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {51849#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51845#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {51853#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51849#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:09:43,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {51857#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51853#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {51861#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51857#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:09:43,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {51865#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51861#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {51869#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51865#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:09:43,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {51873#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51869#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {51873#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {51873#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {51869#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51873#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {51865#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51869#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {51861#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51865#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:09:43,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {51857#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51861#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {51853#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51857#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:09:43,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {51849#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51853#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {51845#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51849#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:09:43,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51845#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {51904#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:09:43,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {51908#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {51904#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:09:43,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {51912#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51908#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:09:43,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {51916#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51912#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:09:43,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {51920#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51916#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:09:43,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {51924#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51920#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:09:43,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {51928#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51924#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:09:43,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {51932#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51928#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:09:43,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {51936#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51932#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:09:43,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {51940#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51936#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:09:43,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {51678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51940#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:09:43,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {51678#true} call #t~ret11 := main(); {51678#true} is VALID
[2022-04-08 10:09:43,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51678#true} {51678#true} #61#return; {51678#true} is VALID
[2022-04-08 10:09:43,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {51678#true} assume true; {51678#true} is VALID
[2022-04-08 10:09:43,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {51678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51678#true} is VALID
[2022-04-08 10:09:43,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {51678#true} call ULTIMATE.init(); {51678#true} is VALID
[2022-04-08 10:09:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:09:43,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675583988] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:09:43,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:09:43,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 53
[2022-04-08 10:09:43,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:09:43,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372145778]
[2022-04-08 10:09:43,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372145778] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:09:43,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:09:43,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2022-04-08 10:09:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384690332]
[2022-04-08 10:09:43,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:09:43,402 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:09:43,402 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:09:43,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:45,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:45,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2022-04-08 10:09:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:09:45,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2022-04-08 10:09:45,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2486, Unknown=0, NotChecked=0, Total=2756
[2022-04-08 10:09:45,022 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:50,812 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions.
[2022-04-08 10:09:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2022-04-08 10:09:50,813 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:09:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:09:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions.
[2022-04-08 10:09:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions.
[2022-04-08 10:09:50,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 58 transitions.
[2022-04-08 10:09:51,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:51,071 INFO L225 Difference]: With dead ends: 154
[2022-04-08 10:09:51,071 INFO L226 Difference]: Without dead ends: 117
[2022-04-08 10:09:51,072 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=551, Invalid=6090, Unknown=1, NotChecked=0, Total=6642
[2022-04-08 10:09:51,072 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:09:51,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 124 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-04-08 10:09:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2022-04-08 10:09:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2022-04-08 10:09:51,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:09:51,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:51,240 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:51,240 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:51,241 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions.
[2022-04-08 10:09:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions.
[2022-04-08 10:09:51,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:09:51,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:09:51,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states.
[2022-04-08 10:09:51,242 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states.
[2022-04-08 10:09:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:51,243 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions.
[2022-04-08 10:09:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions.
[2022-04-08 10:09:51,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:09:51,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:09:51,243 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:09:51,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:09:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions.
[2022-04-08 10:09:51,244 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 38
[2022-04-08 10:09:51,244 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:09:51,244 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions.
[2022-04-08 10:09:51,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:51,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 149 transitions.
[2022-04-08 10:09:52,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions.
[2022-04-08 10:09:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2022-04-08 10:09:52,700 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:09:52,700 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:09:52,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0
[2022-04-08 10:09:52,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:09:52,900 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:09:52,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:09:52,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1555480447, now seen corresponding path program 93 times
[2022-04-08 10:09:52,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:09:52,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266526897]
[2022-04-08 10:09:52,903 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:09:52,903 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:09:52,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1555480447, now seen corresponding path program 94 times
[2022-04-08 10:09:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:09:52,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212892741]
[2022-04-08 10:09:52,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:09:52,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:09:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:09:53,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:09:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:09:53,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {52817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52795#true} is VALID
[2022-04-08 10:09:53,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {52795#true} assume true; {52795#true} is VALID
[2022-04-08 10:09:53,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52795#true} {52795#true} #61#return; {52795#true} is VALID
[2022-04-08 10:09:53,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {52795#true} call ULTIMATE.init(); {52817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:09:53,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {52817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52795#true} is VALID
[2022-04-08 10:09:53,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {52795#true} assume true; {52795#true} is VALID
[2022-04-08 10:09:53,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52795#true} {52795#true} #61#return; {52795#true} is VALID
[2022-04-08 10:09:53,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {52795#true} call #t~ret11 := main(); {52795#true} is VALID
[2022-04-08 10:09:53,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {52795#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52800#(= main_~y~0 0)} is VALID
[2022-04-08 10:09:53,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {52800#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52801#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:09:53,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {52801#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:09:53,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {52802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52803#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:09:53,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {52803#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52804#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:09:53,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {52804#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52805#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:09:53,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {52805#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52806#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:09:53,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {52806#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:09:53,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {52807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52808#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:09:53,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {52808#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:53,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:53,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {52810#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:09:53,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {52810#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52811#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:09:53,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {52811#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52812#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:09:53,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {52812#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52813#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:09:53,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {52813#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52814#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:09:53,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {52814#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52815#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:09:53,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {52815#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52816#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {52816#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {52796#false} assume !(~y~0 % 4294967296 > 0); {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L272 TraceCheckUtils]: 34: Hoare triple {52796#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {52796#false} ~cond := #in~cond; {52796#false} is VALID
[2022-04-08 10:09:53,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {52796#false} assume 0 == ~cond; {52796#false} is VALID
[2022-04-08 10:09:53,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {52796#false} assume !false; {52796#false} is VALID
[2022-04-08 10:09:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:09:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:09:53,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212892741]
[2022-04-08 10:09:53,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212892741] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:09:53,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672924833]
[2022-04-08 10:09:53,171 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:09:53,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:09:53,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:09:53,172 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:09:53,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process
[2022-04-08 10:09:53,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:09:53,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:09:53,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 48 conjunts are in the unsatisfiable core
[2022-04-08 10:09:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:09:53,226 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:09:53,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {52795#true} call ULTIMATE.init(); {52795#true} is VALID
[2022-04-08 10:09:53,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {52795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52795#true} is VALID
[2022-04-08 10:09:53,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {52795#true} assume true; {52795#true} is VALID
[2022-04-08 10:09:53,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52795#true} {52795#true} #61#return; {52795#true} is VALID
[2022-04-08 10:09:53,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {52795#true} call #t~ret11 := main(); {52795#true} is VALID
[2022-04-08 10:09:53,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {52795#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52800#(= main_~y~0 0)} is VALID
[2022-04-08 10:09:53,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {52800#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52801#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:09:53,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {52801#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:09:53,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {52802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52803#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:09:53,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {52803#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52804#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:09:53,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {52804#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52805#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:09:53,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {52805#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52806#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:09:53,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {52806#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:09:53,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {52807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52808#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:09:53,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {52808#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:53,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:53,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {52869#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:53,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {52869#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52873#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:09:53,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {52873#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52877#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:53,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {52877#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52881#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 3)))} is VALID
[2022-04-08 10:09:53,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {52881#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52885#(and (= main_~y~0 (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:53,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {52885#(and (= main_~y~0 (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52889#(and (= (+ 5 main_~z~0) main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:53,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {52889#(and (= (+ 5 main_~z~0) main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52893#(and (= main_~y~0 (+ main_~z~0 6)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:09:53,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {52893#(and (= main_~y~0 (+ main_~z~0 6)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {52796#false} is VALID
[2022-04-08 10:09:53,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {52796#false} assume !(~y~0 % 4294967296 > 0); {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L272 TraceCheckUtils]: 34: Hoare triple {52796#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {52796#false} ~cond := #in~cond; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {52796#false} assume 0 == ~cond; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {52796#false} assume !false; {52796#false} is VALID
[2022-04-08 10:09:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:09:53,542 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:09:54,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {52796#false} assume !false; {52796#false} is VALID
[2022-04-08 10:09:54,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {52796#false} assume 0 == ~cond; {52796#false} is VALID
[2022-04-08 10:09:54,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {52796#false} ~cond := #in~cond; {52796#false} is VALID
[2022-04-08 10:09:54,031 INFO L272 TraceCheckUtils]: 34: Hoare triple {52796#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52796#false} is VALID
[2022-04-08 10:09:54,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {52796#false} assume !(~y~0 % 4294967296 > 0); {52796#false} is VALID
[2022-04-08 10:09:54,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:54,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:54,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {52960#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID
[2022-04-08 10:09:54,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {52964#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52960#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:09:54,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {52968#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52964#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:09:54,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {52972#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52968#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:09:54,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {52976#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52972#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:09:54,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {52980#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52976#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:09:54,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {52984#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52980#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:09:54,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {52988#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {52984#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:09:54,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {52992#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52988#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:09:54,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {52996#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52992#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:09:54,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {53000#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52996#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:09:54,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {53004#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53000#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:09:54,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {53008#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53004#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:09:54,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {53012#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53008#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {52795#true} ~z~0 := ~y~0; {53012#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {52795#true} assume !(~x~0 % 4294967296 > 0); {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {52795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {52795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {52795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {52795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {52795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {52795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {52795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {52795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {52795#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {52795#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {52795#true} call #t~ret11 := main(); {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52795#true} {52795#true} #61#return; {52795#true} is VALID
[2022-04-08 10:09:54,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {52795#true} assume true; {52795#true} is VALID
[2022-04-08 10:09:54,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {52795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52795#true} is VALID
[2022-04-08 10:09:54,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {52795#true} call ULTIMATE.init(); {52795#true} is VALID
[2022-04-08 10:09:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2022-04-08 10:09:54,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672924833] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:09:54,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:09:54,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 41
[2022-04-08 10:09:54,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:09:54,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266526897]
[2022-04-08 10:09:54,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266526897] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:09:54,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:09:54,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-04-08 10:09:54,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65802477]
[2022-04-08 10:09:54,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:09:54,045 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:09:54,045 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:09:54,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:54,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:54,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-04-08 10:09:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:09:54,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-04-08 10:09:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640
[2022-04-08 10:09:54,078 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:55,528 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions.
[2022-04-08 10:09:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-04-08 10:09:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:09:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:09:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions.
[2022-04-08 10:09:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions.
[2022-04-08 10:09:55,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 56 transitions.
[2022-04-08 10:09:55,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:09:55,574 INFO L225 Difference]: With dead ends: 144
[2022-04-08 10:09:55,574 INFO L226 Difference]: Without dead ends: 129
[2022-04-08 10:09:55,575 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=2937, Unknown=0, NotChecked=0, Total=3306
[2022-04-08 10:09:55,575 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:09:55,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:09:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2022-04-08 10:09:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118.
[2022-04-08 10:09:55,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:09:55,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:55,743 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:55,743 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:55,744 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions.
[2022-04-08 10:09:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions.
[2022-04-08 10:09:55,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:09:55,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:09:55,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states.
[2022-04-08 10:09:55,744 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states.
[2022-04-08 10:09:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:09:55,745 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions.
[2022-04-08 10:09:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions.
[2022-04-08 10:09:55,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:09:55,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:09:55,746 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:09:55,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:09:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions.
[2022-04-08 10:09:55,747 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 38
[2022-04-08 10:09:55,747 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:09:55,747 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions.
[2022-04-08 10:09:55,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:09:55,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 150 transitions.
[2022-04-08 10:10:01,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 149 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions.
[2022-04-08 10:10:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2022-04-08 10:10:01,819 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:10:01,819 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:10:01,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0
[2022-04-08 10:10:02,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:02,023 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:10:02,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:10:02,024 INFO L85 PathProgramCache]: Analyzing trace with hash 630692429, now seen corresponding path program 95 times
[2022-04-08 10:10:02,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:02,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [35696897]
[2022-04-08 10:10:02,026 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:10:02,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:10:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 630692429, now seen corresponding path program 96 times
[2022-04-08 10:10:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:10:02,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294015660]
[2022-04-08 10:10:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:10:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:10:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:02,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:10:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:02,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {53903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53882#true} is VALID
[2022-04-08 10:10:02,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {53882#true} assume true; {53882#true} is VALID
[2022-04-08 10:10:02,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53882#true} {53882#true} #61#return; {53882#true} is VALID
[2022-04-08 10:10:02,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {53882#true} call ULTIMATE.init(); {53903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:10:02,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {53903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53882#true} is VALID
[2022-04-08 10:10:02,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {53882#true} assume true; {53882#true} is VALID
[2022-04-08 10:10:02,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53882#true} {53882#true} #61#return; {53882#true} is VALID
[2022-04-08 10:10:02,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {53882#true} call #t~ret11 := main(); {53882#true} is VALID
[2022-04-08 10:10:02,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {53882#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53887#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:02,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {53887#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:02,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {53888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:02,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {53889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:02,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {53890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:02,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {53891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:02,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {53892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:02,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {53893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:02,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {53894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:02,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {53895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53896#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:02,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {53896#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:02,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:02,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {53898#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:10:02,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {53898#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53899#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:10:02,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {53899#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:10:02,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {53900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:10:02,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {53901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53902#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:10:02,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {53902#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53883#false} is VALID
[2022-04-08 10:10:02,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {53883#false} assume !(~y~0 % 4294967296 > 0); {53883#false} is VALID
[2022-04-08 10:10:02,289 INFO L272 TraceCheckUtils]: 34: Hoare triple {53883#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53883#false} is VALID
[2022-04-08 10:10:02,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {53883#false} ~cond := #in~cond; {53883#false} is VALID
[2022-04-08 10:10:02,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {53883#false} assume 0 == ~cond; {53883#false} is VALID
[2022-04-08 10:10:02,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {53883#false} assume !false; {53883#false} is VALID
[2022-04-08 10:10:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:10:02,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:10:02,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294015660]
[2022-04-08 10:10:02,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294015660] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:10:02,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990322741]
[2022-04-08 10:10:02,290 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:10:02,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:02,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:10:02,291 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:10:02,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process
[2022-04-08 10:10:02,524 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s)
[2022-04-08 10:10:02,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:10:02,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 33 conjunts are in the unsatisfiable core
[2022-04-08 10:10:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:02,536 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:10:02,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {53882#true} call ULTIMATE.init(); {53882#true} is VALID
[2022-04-08 10:10:02,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {53882#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53882#true} is VALID
[2022-04-08 10:10:02,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {53882#true} assume true; {53882#true} is VALID
[2022-04-08 10:10:02,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53882#true} {53882#true} #61#return; {53882#true} is VALID
[2022-04-08 10:10:02,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {53882#true} call #t~ret11 := main(); {53882#true} is VALID
[2022-04-08 10:10:02,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {53882#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53887#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:02,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {53887#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:02,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {53888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:02,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {53889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:02,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {53890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:02,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {53891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:02,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {53892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:02,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {53893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:02,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {53894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:02,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {53895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53896#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:02,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {53896#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:02,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:02,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {53898#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:10:02,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {53898#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53899#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:10:02,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {53899#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:10:02,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {53900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:10:02,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {53901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53970#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:10:02,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {53970#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53883#false} is VALID
[2022-04-08 10:10:02,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {53883#false} assume !(~y~0 % 4294967296 > 0); {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L272 TraceCheckUtils]: 34: Hoare triple {53883#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {53883#false} ~cond := #in~cond; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {53883#false} assume 0 == ~cond; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {53883#false} assume !false; {53883#false} is VALID
[2022-04-08 10:10:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:10:02,818 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:10:03,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {53883#false} assume !false; {53883#false} is VALID
[2022-04-08 10:10:03,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {53883#false} assume 0 == ~cond; {53883#false} is VALID
[2022-04-08 10:10:03,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {53883#false} ~cond := #in~cond; {53883#false} is VALID
[2022-04-08 10:10:03,301 INFO L272 TraceCheckUtils]: 34: Hoare triple {53883#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53883#false} is VALID
[2022-04-08 10:10:03,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {53883#false} assume !(~y~0 % 4294967296 > 0); {53883#false} is VALID
[2022-04-08 10:10:03,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID
[2022-04-08 10:10:03,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {54064#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53883#false} is VALID
[2022-04-08 10:10:03,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {54068#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54064#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:10:03,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {54072#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54068#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:03,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {54076#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54072#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:10:03,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {54080#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54076#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:10:03,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {54084#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {54080#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:10:03,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {54084#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54084#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:03,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {54091#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54084#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:03,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {54095#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54091#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:10:03,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {54099#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54095#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:10:03,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {54103#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54099#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:03,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {54107#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54103#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:10:03,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {54111#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54107#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:10:03,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {54115#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54111#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:10:03,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {54119#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54115#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:10:03,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {54123#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54119#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:10:03,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {54127#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54123#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:03,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {53882#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54127#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:10:03,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {53882#true} call #t~ret11 := main(); {53882#true} is VALID
[2022-04-08 10:10:03,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53882#true} {53882#true} #61#return; {53882#true} is VALID
[2022-04-08 10:10:03,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {53882#true} assume true; {53882#true} is VALID
[2022-04-08 10:10:03,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {53882#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53882#true} is VALID
[2022-04-08 10:10:03,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {53882#true} call ULTIMATE.init(); {53882#true} is VALID
[2022-04-08 10:10:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:10:03,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990322741] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:10:03,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:10:03,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36
[2022-04-08 10:10:03,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:10:03,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [35696897]
[2022-04-08 10:10:03,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [35696897] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:10:03,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:10:03,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2022-04-08 10:10:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003256880]
[2022-04-08 10:10:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:10:03,316 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:10:03,316 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:10:03,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:03,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:03,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-08 10:10:03,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-08 10:10:03,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260
[2022-04-08 10:10:03,336 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:04,647 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions.
[2022-04-08 10:10:04,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2022-04-08 10:10:04,647 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:10:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:10:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 64 transitions.
[2022-04-08 10:10:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 64 transitions.
[2022-04-08 10:10:04,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 64 transitions.
[2022-04-08 10:10:04,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:04,699 INFO L225 Difference]: With dead ends: 147
[2022-04-08 10:10:04,699 INFO L226 Difference]: Without dead ends: 131
[2022-04-08 10:10:04,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=592, Invalid=2488, Unknown=0, NotChecked=0, Total=3080
[2022-04-08 10:10:04,699 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-08 10:10:04,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-08 10:10:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2022-04-08 10:10:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119.
[2022-04-08 10:10:04,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:10:04,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:04,842 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:04,842 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:04,843 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions.
[2022-04-08 10:10:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions.
[2022-04-08 10:10:04,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:04,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:04,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states.
[2022-04-08 10:10:04,844 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states.
[2022-04-08 10:10:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:04,845 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions.
[2022-04-08 10:10:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions.
[2022-04-08 10:10:04,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:04,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:04,845 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:10:04,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:10:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions.
[2022-04-08 10:10:04,846 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 38
[2022-04-08 10:10:04,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:10:04,846 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions.
[2022-04-08 10:10:04,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:04,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 151 transitions.
[2022-04-08 10:10:08,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 150 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions.
[2022-04-08 10:10:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2022-04-08 10:10:08,960 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:10:08,960 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:10:08,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0
[2022-04-08 10:10:09,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:09,161 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:10:09,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:10:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1787736705, now seen corresponding path program 97 times
[2022-04-08 10:10:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:09,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334699564]
[2022-04-08 10:10:09,163 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:10:09,163 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:10:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1787736705, now seen corresponding path program 98 times
[2022-04-08 10:10:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:10:09,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193231491]
[2022-04-08 10:10:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:10:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:10:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:10:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:09,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {55002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54982#true} is VALID
[2022-04-08 10:10:09,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {54982#true} assume true; {54982#true} is VALID
[2022-04-08 10:10:09,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54982#true} {54982#true} #61#return; {54982#true} is VALID
[2022-04-08 10:10:09,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {54982#true} call ULTIMATE.init(); {55002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:10:09,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {55002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54982#true} is VALID
[2022-04-08 10:10:09,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {54982#true} assume true; {54982#true} is VALID
[2022-04-08 10:10:09,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54982#true} {54982#true} #61#return; {54982#true} is VALID
[2022-04-08 10:10:09,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {54982#true} call #t~ret11 := main(); {54982#true} is VALID
[2022-04-08 10:10:09,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {54982#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54987#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:09,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {54987#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54988#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:09,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {54988#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:09,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {54989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54990#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:09,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {54990#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:09,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {54991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54992#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:09,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {54992#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54993#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:09,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {54993#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54994#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:09,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {54994#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54995#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:09,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {54995#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54996#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:09,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {54996#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54997#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:09,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {54997#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:09,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:09,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {54999#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:10:09,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {54999#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55000#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:10:09,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {55000#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55001#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {55001#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {54983#false} assume !(~y~0 % 4294967296 > 0); {54983#false} is VALID
[2022-04-08 10:10:09,393 INFO L272 TraceCheckUtils]: 34: Hoare triple {54983#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {54983#false} is VALID
[2022-04-08 10:10:09,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {54983#false} ~cond := #in~cond; {54983#false} is VALID
[2022-04-08 10:10:09,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {54983#false} assume 0 == ~cond; {54983#false} is VALID
[2022-04-08 10:10:09,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {54983#false} assume !false; {54983#false} is VALID
[2022-04-08 10:10:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:10:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:10:09,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193231491]
[2022-04-08 10:10:09,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193231491] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:10:09,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343722933]
[2022-04-08 10:10:09,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:10:09,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:09,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:10:09,394 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:10:09,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process
[2022-04-08 10:10:09,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:10:09,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:10:09,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core
[2022-04-08 10:10:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:09,445 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:10:09,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {54982#true} call ULTIMATE.init(); {54982#true} is VALID
[2022-04-08 10:10:09,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {54982#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54982#true} is VALID
[2022-04-08 10:10:09,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {54982#true} assume true; {54982#true} is VALID
[2022-04-08 10:10:09,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54982#true} {54982#true} #61#return; {54982#true} is VALID
[2022-04-08 10:10:09,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {54982#true} call #t~ret11 := main(); {54982#true} is VALID
[2022-04-08 10:10:09,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {54982#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54987#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:09,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {54987#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54988#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:09,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {54988#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:09,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {54989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54990#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:09,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {54990#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:09,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {54991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54992#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:09,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {54992#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54993#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:09,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {54993#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54994#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:09,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {54994#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54995#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:09,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {54995#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54996#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:09,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {54996#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54997#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:09,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {54997#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:09,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:09,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {54999#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:10:09,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {54999#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55000#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:10:09,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {55000#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55066#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {55066#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:09,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {54983#false} assume !(~y~0 % 4294967296 > 0); {54983#false} is VALID
[2022-04-08 10:10:09,713 INFO L272 TraceCheckUtils]: 34: Hoare triple {54983#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {54983#false} is VALID
[2022-04-08 10:10:09,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {54983#false} ~cond := #in~cond; {54983#false} is VALID
[2022-04-08 10:10:09,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {54983#false} assume 0 == ~cond; {54983#false} is VALID
[2022-04-08 10:10:09,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {54983#false} assume !false; {54983#false} is VALID
[2022-04-08 10:10:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:10:09,713 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:10:10,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {54983#false} assume !false; {54983#false} is VALID
[2022-04-08 10:10:10,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {54983#false} assume 0 == ~cond; {54983#false} is VALID
[2022-04-08 10:10:10,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {54983#false} ~cond := #in~cond; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L272 TraceCheckUtils]: 34: Hoare triple {54983#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {54983#false} assume !(~y~0 % 4294967296 > 0); {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID
[2022-04-08 10:10:10,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {55166#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {54983#false} is VALID
[2022-04-08 10:10:10,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {55170#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55166#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:10:10,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {55174#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55170#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:10,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {55178#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {55174#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:10:10,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {55178#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {55178#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:10:10,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {55185#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55178#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:10:10,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {55189#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55185#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:10,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {55193#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55189#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:10:10,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {55197#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55193#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:10:10,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {55201#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55197#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:10:10,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {55205#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55201#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:10:10,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {55209#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55205#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:10:10,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {55213#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55209#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:10,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {55217#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55213#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:10:10,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {55221#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55217#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:10,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {55225#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55221#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:10:10,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {54982#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55225#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:10:10,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {54982#true} call #t~ret11 := main(); {54982#true} is VALID
[2022-04-08 10:10:10,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54982#true} {54982#true} #61#return; {54982#true} is VALID
[2022-04-08 10:10:10,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {54982#true} assume true; {54982#true} is VALID
[2022-04-08 10:10:10,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {54982#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54982#true} is VALID
[2022-04-08 10:10:10,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {54982#true} call ULTIMATE.init(); {54982#true} is VALID
[2022-04-08 10:10:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:10:10,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343722933] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:10:10,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:10:10,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34
[2022-04-08 10:10:10,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:10:10,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334699564]
[2022-04-08 10:10:10,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334699564] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:10:10,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:10:10,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-04-08 10:10:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171893504]
[2022-04-08 10:10:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:10:10,143 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:10:10,143 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:10:10,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:10,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:10,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-04-08 10:10:10,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:10,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-04-08 10:10:10,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122
[2022-04-08 10:10:10,162 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:11,437 INFO L93 Difference]: Finished difference Result 150 states and 182 transitions.
[2022-04-08 10:10:11,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2022-04-08 10:10:11,437 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:10:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:10:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 67 transitions.
[2022-04-08 10:10:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 67 transitions.
[2022-04-08 10:10:11,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 67 transitions.
[2022-04-08 10:10:11,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:11,494 INFO L225 Difference]: With dead ends: 150
[2022-04-08 10:10:11,494 INFO L226 Difference]: Without dead ends: 133
[2022-04-08 10:10:11,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652
[2022-04-08 10:10:11,495 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:10:11,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 87 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:10:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2022-04-08 10:10:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120.
[2022-04-08 10:10:11,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:10:11,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:11,654 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:11,654 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:11,655 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions.
[2022-04-08 10:10:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions.
[2022-04-08 10:10:11,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:11,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:11,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states.
[2022-04-08 10:10:11,655 INFO L87 Difference]: Start difference. First operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states.
[2022-04-08 10:10:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:11,656 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions.
[2022-04-08 10:10:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions.
[2022-04-08 10:10:11,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:11,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:11,657 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:10:11,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:10:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions.
[2022-04-08 10:10:11,658 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 38
[2022-04-08 10:10:11,658 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:10:11,658 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions.
[2022-04-08 10:10:11,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:11,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 152 transitions.
[2022-04-08 10:10:14,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 151 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions.
[2022-04-08 10:10:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2022-04-08 10:10:14,179 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:10:14,179 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:10:14,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0
[2022-04-08 10:10:14,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72
[2022-04-08 10:10:14,380 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:10:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:10:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash -805427507, now seen corresponding path program 47 times
[2022-04-08 10:10:14,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:14,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022086800]
[2022-04-08 10:10:14,382 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:10:14,382 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:10:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash -805427507, now seen corresponding path program 48 times
[2022-04-08 10:10:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:10:14,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136268492]
[2022-04-08 10:10:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:10:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:10:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:10:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:14,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {56119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56088#true} is VALID
[2022-04-08 10:10:14,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {56088#true} assume true; {56088#true} is VALID
[2022-04-08 10:10:14,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56088#true} {56088#true} #61#return; {56088#true} is VALID
[2022-04-08 10:10:14,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {56088#true} call ULTIMATE.init(); {56119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:10:14,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {56119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56088#true} is VALID
[2022-04-08 10:10:14,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {56088#true} assume true; {56088#true} is VALID
[2022-04-08 10:10:14,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56088#true} {56088#true} #61#return; {56088#true} is VALID
[2022-04-08 10:10:14,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {56088#true} call #t~ret11 := main(); {56088#true} is VALID
[2022-04-08 10:10:14,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {56088#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56093#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:14,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {56093#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56094#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:14,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {56094#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56095#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:14,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {56095#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56096#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:14,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {56096#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56097#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:14,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {56097#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56098#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:14,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {56098#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56099#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:14,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {56099#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56100#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:14,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {56100#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56101#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:14,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {56101#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56102#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:14,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {56102#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56103#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:14,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {56103#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56104#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:14,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {56104#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56105#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:10:14,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {56105#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56106#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:10:14,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {56106#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56107#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:10:14,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {56107#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56108#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:10:14,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {56108#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56109#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:10:14,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {56109#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56110#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:10:14,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {56110#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56111#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:10:14,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {56111#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56112#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:10:14,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {56112#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56113#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:10:14,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {56113#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56114#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:10:14,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {56114#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56115#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:10:14,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {56115#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56116#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:10:14,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {56116#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:10:14,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:10:14,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {56118#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID
[2022-04-08 10:10:14,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {56118#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {56089#false} is VALID
[2022-04-08 10:10:14,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {56089#false} assume !(~y~0 % 4294967296 > 0); {56089#false} is VALID
[2022-04-08 10:10:14,849 INFO L272 TraceCheckUtils]: 34: Hoare triple {56089#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56089#false} is VALID
[2022-04-08 10:10:14,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {56089#false} ~cond := #in~cond; {56089#false} is VALID
[2022-04-08 10:10:14,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {56089#false} assume 0 == ~cond; {56089#false} is VALID
[2022-04-08 10:10:14,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {56089#false} assume !false; {56089#false} is VALID
[2022-04-08 10:10:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:10:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:10:14,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136268492]
[2022-04-08 10:10:14,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136268492] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:10:14,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343535390]
[2022-04-08 10:10:14,850 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:10:14,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:14,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:10:14,851 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:10:14,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process
[2022-04-08 10:10:15,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s)
[2022-04-08 10:10:15,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:10:15,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 55 conjunts are in the unsatisfiable core
[2022-04-08 10:10:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:15,990 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:10:16,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {56088#true} call ULTIMATE.init(); {56088#true} is VALID
[2022-04-08 10:10:16,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {56088#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56088#true} is VALID
[2022-04-08 10:10:16,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {56088#true} assume true; {56088#true} is VALID
[2022-04-08 10:10:16,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56088#true} {56088#true} #61#return; {56088#true} is VALID
[2022-04-08 10:10:16,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {56088#true} call #t~ret11 := main(); {56088#true} is VALID
[2022-04-08 10:10:16,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {56088#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56093#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:16,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {56093#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56094#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:16,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {56094#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56095#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:16,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {56095#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56096#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:16,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {56096#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56097#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:16,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {56097#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56098#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:16,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {56098#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56099#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:16,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {56099#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56100#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:16,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {56100#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56101#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:16,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {56101#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56102#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:16,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {56102#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56103#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:16,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {56103#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56104#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:16,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {56104#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56105#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:10:16,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {56105#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56106#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:10:16,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {56106#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56107#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:10:16,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {56107#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56108#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:10:16,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {56108#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56109#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:10:16,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {56109#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56110#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:10:16,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {56110#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56111#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:10:16,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {56111#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56112#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:10:16,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {56112#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56113#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:10:16,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {56113#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56114#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:10:16,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {56114#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56115#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:10:16,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {56115#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56116#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:10:16,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {56116#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:10:16,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:10:16,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {56216#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID
[2022-04-08 10:10:16,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {56216#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {56089#false} is VALID
[2022-04-08 10:10:16,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {56089#false} assume !(~y~0 % 4294967296 > 0); {56089#false} is VALID
[2022-04-08 10:10:16,437 INFO L272 TraceCheckUtils]: 34: Hoare triple {56089#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56089#false} is VALID
[2022-04-08 10:10:16,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {56089#false} ~cond := #in~cond; {56089#false} is VALID
[2022-04-08 10:10:16,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {56089#false} assume 0 == ~cond; {56089#false} is VALID
[2022-04-08 10:10:16,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {56089#false} assume !false; {56089#false} is VALID
[2022-04-08 10:10:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:10:16,438 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:10:17,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {56089#false} assume !false; {56089#false} is VALID
[2022-04-08 10:10:17,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {56089#false} assume 0 == ~cond; {56089#false} is VALID
[2022-04-08 10:10:17,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {56089#false} ~cond := #in~cond; {56089#false} is VALID
[2022-04-08 10:10:17,636 INFO L272 TraceCheckUtils]: 34: Hoare triple {56089#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56089#false} is VALID
[2022-04-08 10:10:17,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {56089#false} assume !(~y~0 % 4294967296 > 0); {56089#false} is VALID
[2022-04-08 10:10:17,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {56250#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56089#false} is VALID
[2022-04-08 10:10:17,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {56254#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {56250#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:10:17,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {56254#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {56254#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:10:17,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {56261#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56254#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:10:17,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {56265#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56261#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:10:17,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {56269#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56265#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:10:17,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {56273#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56269#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:10:17,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {56277#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56273#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {56281#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56277#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:17,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {56285#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56281#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:10:17,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {56289#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56285#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:17,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {56293#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56289#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:10:17,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {56297#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56293#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:10:17,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {56301#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56297#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:10:17,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {56305#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56301#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:10:17,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {56309#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56305#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:10:17,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {56313#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56309#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:10:17,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {56317#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56313#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:10:17,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {56321#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56317#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:10:17,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {56325#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56321#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:10:17,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {56329#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56325#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:10:17,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {56333#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56329#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:10:17,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {56337#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56333#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:17,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {56341#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56337#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:10:17,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {56345#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56341#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID
[2022-04-08 10:10:17,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {56349#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56345#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID
[2022-04-08 10:10:17,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {56353#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {56349#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:17,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {56088#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56353#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID
[2022-04-08 10:10:17,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {56088#true} call #t~ret11 := main(); {56088#true} is VALID
[2022-04-08 10:10:17,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56088#true} {56088#true} #61#return; {56088#true} is VALID
[2022-04-08 10:10:17,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {56088#true} assume true; {56088#true} is VALID
[2022-04-08 10:10:17,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {56088#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {56088#true} is VALID
[2022-04-08 10:10:17,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {56088#true} call ULTIMATE.init(); {56088#true} is VALID
[2022-04-08 10:10:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:10:17,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343535390] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:10:17,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:10:17,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56
[2022-04-08 10:10:17,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:10:17,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022086800]
[2022-04-08 10:10:17,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022086800] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:10:17,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:10:17,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29
[2022-04-08 10:10:17,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912194996]
[2022-04-08 10:10:17,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:10:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:10:17,654 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:10:17,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:17,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:17,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2022-04-08 10:10:17,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:17,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2022-04-08 10:10:17,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080
[2022-04-08 10:10:17,675 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:22,476 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions.
[2022-04-08 10:10:22,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2022-04-08 10:10:22,476 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38
[2022-04-08 10:10:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:10:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 165 transitions.
[2022-04-08 10:10:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 165 transitions.
[2022-04-08 10:10:22,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 165 transitions.
[2022-04-08 10:10:22,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:22,605 INFO L225 Difference]: With dead ends: 156
[2022-04-08 10:10:22,605 INFO L226 Difference]: Without dead ends: 150
[2022-04-08 10:10:22,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1492, Invalid=5150, Unknown=0, NotChecked=0, Total=6642
[2022-04-08 10:10:22,606 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:10:22,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 189 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2022-04-08 10:10:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2022-04-08 10:10:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 125.
[2022-04-08 10:10:22,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:10:22,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:22,736 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:22,736 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:22,737 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions.
[2022-04-08 10:10:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions.
[2022-04-08 10:10:22,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:22,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:22,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states.
[2022-04-08 10:10:22,737 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states.
[2022-04-08 10:10:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:22,739 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions.
[2022-04-08 10:10:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions.
[2022-04-08 10:10:22,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:22,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:22,739 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:10:22,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:10:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions.
[2022-04-08 10:10:22,740 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 159 transitions. Word has length 38
[2022-04-08 10:10:22,740 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:10:22,740 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 159 transitions.
[2022-04-08 10:10:22,740 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:22,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 159 transitions.
[2022-04-08 10:10:26,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions.
[2022-04-08 10:10:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2022-04-08 10:10:26,770 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:10:26,770 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:10:26,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0
[2022-04-08 10:10:26,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:26,971 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:10:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:10:26,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1865343295, now seen corresponding path program 99 times
[2022-04-08 10:10:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:26,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1470806054]
[2022-04-08 10:10:26,973 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:10:26,973 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:10:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1865343295, now seen corresponding path program 100 times
[2022-04-08 10:10:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:10:26,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26764497]
[2022-04-08 10:10:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:10:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:10:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:10:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:27,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {57311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57288#true} is VALID
[2022-04-08 10:10:27,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {57288#true} assume true; {57288#true} is VALID
[2022-04-08 10:10:27,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57288#true} {57288#true} #61#return; {57288#true} is VALID
[2022-04-08 10:10:27,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {57288#true} call ULTIMATE.init(); {57311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:10:27,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {57311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57288#true} is VALID
[2022-04-08 10:10:27,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {57288#true} assume true; {57288#true} is VALID
[2022-04-08 10:10:27,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57288#true} {57288#true} #61#return; {57288#true} is VALID
[2022-04-08 10:10:27,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {57288#true} call #t~ret11 := main(); {57288#true} is VALID
[2022-04-08 10:10:27,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {57288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57293#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:27,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {57293#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:27,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {57294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:27,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {57295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:27,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {57296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:27,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {57297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:27,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {57298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:27,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {57299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:27,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {57300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:27,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {57301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {57303#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:10:27,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {57303#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57304#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:10:27,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {57304#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57305#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:10:27,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {57305#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57306#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:10:27,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {57306#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57307#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:10:27,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {57307#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57308#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:10:27,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {57308#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57309#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:10:27,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {57309#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57310#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:10:27,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {57310#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {57289#false} assume !(~y~0 % 4294967296 > 0); {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L272 TraceCheckUtils]: 35: Hoare triple {57289#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {57289#false} ~cond := #in~cond; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {57289#false} assume 0 == ~cond; {57289#false} is VALID
[2022-04-08 10:10:27,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {57289#false} assume !false; {57289#false} is VALID
[2022-04-08 10:10:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:10:27,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:10:27,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26764497]
[2022-04-08 10:10:27,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26764497] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:10:27,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388844960]
[2022-04-08 10:10:27,254 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:10:27,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:27,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:10:27,255 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:10:27,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process
[2022-04-08 10:10:27,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:10:27,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:10:27,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 52 conjunts are in the unsatisfiable core
[2022-04-08 10:10:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:27,309 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:10:27,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {57288#true} call ULTIMATE.init(); {57288#true} is VALID
[2022-04-08 10:10:27,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {57288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57288#true} is VALID
[2022-04-08 10:10:27,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {57288#true} assume true; {57288#true} is VALID
[2022-04-08 10:10:27,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57288#true} {57288#true} #61#return; {57288#true} is VALID
[2022-04-08 10:10:27,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {57288#true} call #t~ret11 := main(); {57288#true} is VALID
[2022-04-08 10:10:27,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {57288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57293#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:27,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {57293#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:27,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {57294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:27,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {57295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:27,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {57296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:27,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {57297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:27,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {57298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:27,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {57299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:27,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {57300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:27,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {57301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {57363#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {57363#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57367#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:10:27,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {57367#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57371#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {57371#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57375#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {57375#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57379#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {57379#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57383#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {57383#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57387#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {57387#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57391#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:27,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {57391#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {57289#false} is VALID
[2022-04-08 10:10:27,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:27,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {57289#false} assume !(~y~0 % 4294967296 > 0); {57289#false} is VALID
[2022-04-08 10:10:27,666 INFO L272 TraceCheckUtils]: 35: Hoare triple {57289#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57289#false} is VALID
[2022-04-08 10:10:27,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {57289#false} ~cond := #in~cond; {57289#false} is VALID
[2022-04-08 10:10:27,666 INFO L290 TraceCheckUtils]: 37: Hoare triple {57289#false} assume 0 == ~cond; {57289#false} is VALID
[2022-04-08 10:10:27,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {57289#false} assume !false; {57289#false} is VALID
[2022-04-08 10:10:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:10:27,666 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:10:28,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {57289#false} assume !false; {57289#false} is VALID
[2022-04-08 10:10:28,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {57289#false} assume 0 == ~cond; {57289#false} is VALID
[2022-04-08 10:10:28,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {57289#false} ~cond := #in~cond; {57289#false} is VALID
[2022-04-08 10:10:28,238 INFO L272 TraceCheckUtils]: 35: Hoare triple {57289#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57289#false} is VALID
[2022-04-08 10:10:28,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {57289#false} assume !(~y~0 % 4294967296 > 0); {57289#false} is VALID
[2022-04-08 10:10:28,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:28,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {57455#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID
[2022-04-08 10:10:28,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {57459#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57455#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:10:28,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {57463#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57459#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:10:28,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {57467#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57463#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:10:28,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {57471#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57467#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:10:28,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {57475#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57471#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:10:28,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {57479#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57475#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:10:28,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {57483#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57479#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:10:28,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {57487#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {57483#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:10:28,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {57491#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57487#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:10:28,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {57495#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57491#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:10:28,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {57499#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57495#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:10:28,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {57503#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57499#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:10:28,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {57507#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57503#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:10:28,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {57511#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57507#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:10:28,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {57515#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57511#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:10:28,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {57288#true} ~z~0 := ~y~0; {57515#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:10:28,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {57288#true} assume !(~x~0 % 4294967296 > 0); {57288#true} is VALID
[2022-04-08 10:10:28,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {57288#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57288#true} is VALID
[2022-04-08 10:10:28,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {57288#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {57288#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {57288#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {57288#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {57288#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {57288#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {57288#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {57288#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {57288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {57288#true} call #t~ret11 := main(); {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57288#true} {57288#true} #61#return; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {57288#true} assume true; {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {57288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57288#true} is VALID
[2022-04-08 10:10:28,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {57288#true} call ULTIMATE.init(); {57288#true} is VALID
[2022-04-08 10:10:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-04-08 10:10:28,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388844960] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:10:28,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:10:28,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 18] total 45
[2022-04-08 10:10:28,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:10:28,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1470806054]
[2022-04-08 10:10:28,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1470806054] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:10:28,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:10:28,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2022-04-08 10:10:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725382235]
[2022-04-08 10:10:28,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:10:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:28,260 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:10:28,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:28,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:28,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2022-04-08 10:10:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2022-04-08 10:10:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1728, Unknown=0, NotChecked=0, Total=1980
[2022-04-08 10:10:28,280 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:29,703 INFO L93 Difference]: Finished difference Result 152 states and 186 transitions.
[2022-04-08 10:10:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2022-04-08 10:10:29,703 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:10:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions.
[2022-04-08 10:10:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions.
[2022-04-08 10:10:29,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 57 transitions.
[2022-04-08 10:10:29,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:29,748 INFO L225 Difference]: With dead ends: 152
[2022-04-08 10:10:29,749 INFO L226 Difference]: Without dead ends: 137
[2022-04-08 10:10:29,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=430, Invalid=3476, Unknown=0, NotChecked=0, Total=3906
[2022-04-08 10:10:29,749 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:10:29,749 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:10:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states.
[2022-04-08 10:10:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126.
[2022-04-08 10:10:29,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:10:29,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:29,881 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:29,881 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:29,883 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions.
[2022-04-08 10:10:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions.
[2022-04-08 10:10:29,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:29,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:29,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states.
[2022-04-08 10:10:29,883 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states.
[2022-04-08 10:10:29,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:29,884 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions.
[2022-04-08 10:10:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions.
[2022-04-08 10:10:29,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:29,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:29,884 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:10:29,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:10:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions.
[2022-04-08 10:10:29,886 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 160 transitions. Word has length 39
[2022-04-08 10:10:29,886 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:10:29,886 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 160 transitions.
[2022-04-08 10:10:29,886 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:29,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 160 transitions.
[2022-04-08 10:10:31,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions.
[2022-04-08 10:10:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2022-04-08 10:10:31,480 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:10:31,480 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:10:31,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0
[2022-04-08 10:10:31,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:31,691 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:10:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:10:31,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1135246993, now seen corresponding path program 101 times
[2022-04-08 10:10:31,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:31,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909205338]
[2022-04-08 10:10:31,693 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:10:31,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:10:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1135246993, now seen corresponding path program 102 times
[2022-04-08 10:10:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:10:31,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112415583]
[2022-04-08 10:10:31,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:10:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:10:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:10:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:31,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {58457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58435#true} is VALID
[2022-04-08 10:10:31,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {58435#true} assume true; {58435#true} is VALID
[2022-04-08 10:10:31,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58435#true} {58435#true} #61#return; {58435#true} is VALID
[2022-04-08 10:10:31,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {58435#true} call ULTIMATE.init(); {58457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:10:31,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {58457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58435#true} is VALID
[2022-04-08 10:10:31,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {58435#true} assume true; {58435#true} is VALID
[2022-04-08 10:10:31,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58435#true} {58435#true} #61#return; {58435#true} is VALID
[2022-04-08 10:10:31,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {58435#true} call #t~ret11 := main(); {58435#true} is VALID
[2022-04-08 10:10:31,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {58435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58440#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:31,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {58440#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58441#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:31,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {58441#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58442#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:31,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {58442#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58443#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:31,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {58443#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58444#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:31,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {58444#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58445#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:31,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {58445#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58446#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:31,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {58446#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58447#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:31,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {58447#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58448#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:31,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {58448#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58449#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:31,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {58449#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:31,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:31,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {58451#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:10:31,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {58451#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58452#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:10:31,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {58452#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58453#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:10:31,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {58453#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58454#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:10:31,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {58454#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58455#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:10:31,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {58455#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58456#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {58456#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:31,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {58436#false} assume !(~y~0 % 4294967296 > 0); {58436#false} is VALID
[2022-04-08 10:10:31,971 INFO L272 TraceCheckUtils]: 35: Hoare triple {58436#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58436#false} is VALID
[2022-04-08 10:10:31,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {58436#false} ~cond := #in~cond; {58436#false} is VALID
[2022-04-08 10:10:31,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {58436#false} assume 0 == ~cond; {58436#false} is VALID
[2022-04-08 10:10:31,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {58436#false} assume !false; {58436#false} is VALID
[2022-04-08 10:10:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:10:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:10:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112415583]
[2022-04-08 10:10:31,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112415583] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:10:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238873377]
[2022-04-08 10:10:31,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:10:31,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:31,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:10:31,972 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:10:31,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process
[2022-04-08 10:10:32,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s)
[2022-04-08 10:10:32,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:10:32,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 35 conjunts are in the unsatisfiable core
[2022-04-08 10:10:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:32,156 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:10:32,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {58435#true} call ULTIMATE.init(); {58435#true} is VALID
[2022-04-08 10:10:32,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {58435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58435#true} is VALID
[2022-04-08 10:10:32,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {58435#true} assume true; {58435#true} is VALID
[2022-04-08 10:10:32,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58435#true} {58435#true} #61#return; {58435#true} is VALID
[2022-04-08 10:10:32,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {58435#true} call #t~ret11 := main(); {58435#true} is VALID
[2022-04-08 10:10:32,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {58435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58440#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:32,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {58440#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58441#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:32,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {58441#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58442#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:32,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {58442#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58443#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:32,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {58443#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58444#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:32,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {58444#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58445#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:32,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {58445#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58446#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:32,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {58446#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58447#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:32,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {58447#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58448#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:32,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {58448#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58449#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:32,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {58449#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:32,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:32,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {58451#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:10:32,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {58451#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58452#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:10:32,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {58452#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58453#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:10:32,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {58453#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58454#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:10:32,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {58454#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58455#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:10:32,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {58455#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58527#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {58527#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {58436#false} assume !(~y~0 % 4294967296 > 0); {58436#false} is VALID
[2022-04-08 10:10:32,424 INFO L272 TraceCheckUtils]: 35: Hoare triple {58436#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58436#false} is VALID
[2022-04-08 10:10:32,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {58436#false} ~cond := #in~cond; {58436#false} is VALID
[2022-04-08 10:10:32,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {58436#false} assume 0 == ~cond; {58436#false} is VALID
[2022-04-08 10:10:32,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {58436#false} assume !false; {58436#false} is VALID
[2022-04-08 10:10:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:10:32,424 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:10:32,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {58436#false} assume !false; {58436#false} is VALID
[2022-04-08 10:10:32,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {58436#false} assume 0 == ~cond; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {58436#false} ~cond := #in~cond; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L272 TraceCheckUtils]: 35: Hoare triple {58436#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {58436#false} assume !(~y~0 % 4294967296 > 0); {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID
[2022-04-08 10:10:32,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {58621#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58436#false} is VALID
[2022-04-08 10:10:32,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {58625#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58621#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:10:32,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {58629#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58625#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:32,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {58633#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58629#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:10:32,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {58637#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58633#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:10:32,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {58641#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58637#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:10:32,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {58645#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {58641#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:10:32,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {58645#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {58645#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:32,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {58652#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58645#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:32,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {58656#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58652#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:32,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {58660#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58656#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:10:32,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {58664#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58660#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:10:32,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {58668#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58664#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:32,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {58672#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58668#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:10:32,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {58676#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58672#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:10:32,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {58680#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58676#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:10:32,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {58684#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58680#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:10:32,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {58688#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58684#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:10:32,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {58435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58688#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:32,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {58435#true} call #t~ret11 := main(); {58435#true} is VALID
[2022-04-08 10:10:32,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58435#true} {58435#true} #61#return; {58435#true} is VALID
[2022-04-08 10:10:32,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {58435#true} assume true; {58435#true} is VALID
[2022-04-08 10:10:32,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {58435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58435#true} is VALID
[2022-04-08 10:10:32,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {58435#true} call ULTIMATE.init(); {58435#true} is VALID
[2022-04-08 10:10:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:10:32,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238873377] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:10:32,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:10:32,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38
[2022-04-08 10:10:32,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:10:32,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [909205338]
[2022-04-08 10:10:32,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [909205338] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:10:32,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:10:32,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-04-08 10:10:32,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469860994]
[2022-04-08 10:10:32,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:10:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:32,932 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:10:32,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:32,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:32,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-04-08 10:10:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:32,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-04-08 10:10:32,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406
[2022-04-08 10:10:32,953 INFO L87 Difference]: Start difference. First operand 126 states and 160 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:34,402 INFO L93 Difference]: Finished difference Result 155 states and 189 transitions.
[2022-04-08 10:10:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2022-04-08 10:10:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:10:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions.
[2022-04-08 10:10:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions.
[2022-04-08 10:10:34,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 66 transitions.
[2022-04-08 10:10:34,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:34,455 INFO L225 Difference]: With dead ends: 155
[2022-04-08 10:10:34,455 INFO L226 Difference]: Without dead ends: 139
[2022-04-08 10:10:34,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=662, Invalid=2878, Unknown=0, NotChecked=0, Total=3540
[2022-04-08 10:10:34,456 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:10:34,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:10:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2022-04-08 10:10:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127.
[2022-04-08 10:10:34,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:10:34,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:34,591 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:34,591 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:34,592 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions.
[2022-04-08 10:10:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions.
[2022-04-08 10:10:34,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:34,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:34,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states.
[2022-04-08 10:10:34,593 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states.
[2022-04-08 10:10:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:34,594 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions.
[2022-04-08 10:10:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions.
[2022-04-08 10:10:34,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:34,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:34,594 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:10:34,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:10:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions.
[2022-04-08 10:10:34,595 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 39
[2022-04-08 10:10:34,595 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:10:34,595 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions.
[2022-04-08 10:10:34,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:34,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 161 transitions.
[2022-04-08 10:10:38,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 160 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions.
[2022-04-08 10:10:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2022-04-08 10:10:38,178 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:10:38,178 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:10:38,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0
[2022-04-08 10:10:38,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75
[2022-04-08 10:10:38,379 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:10:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:10:38,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1958069505, now seen corresponding path program 103 times
[2022-04-08 10:10:38,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:38,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [761473751]
[2022-04-08 10:10:38,381 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:10:38,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:10:38,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1958069505, now seen corresponding path program 104 times
[2022-04-08 10:10:38,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:10:38,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008492111]
[2022-04-08 10:10:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:10:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:10:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:38,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:10:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:38,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {59616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59595#true} is VALID
[2022-04-08 10:10:38,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {59595#true} assume true; {59595#true} is VALID
[2022-04-08 10:10:38,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59595#true} {59595#true} #61#return; {59595#true} is VALID
[2022-04-08 10:10:38,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {59595#true} call ULTIMATE.init(); {59616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:10:38,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {59616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59595#true} is VALID
[2022-04-08 10:10:38,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {59595#true} assume true; {59595#true} is VALID
[2022-04-08 10:10:38,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59595#true} {59595#true} #61#return; {59595#true} is VALID
[2022-04-08 10:10:38,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {59595#true} call #t~ret11 := main(); {59595#true} is VALID
[2022-04-08 10:10:38,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {59595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59600#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:38,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {59600#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:38,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {59601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:38,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {59602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:38,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {59603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:38,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {59604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:38,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {59605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:38,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {59606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:38,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {59607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:38,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {59608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:38,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {59609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:38,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {59610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:38,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:38,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {59612#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:10:38,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {59612#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59613#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:10:38,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {59613#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:10:38,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {59614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59615#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {59615#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {59596#false} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {59596#false} assume !(~y~0 % 4294967296 > 0); {59596#false} is VALID
[2022-04-08 10:10:38,622 INFO L272 TraceCheckUtils]: 35: Hoare triple {59596#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59596#false} is VALID
[2022-04-08 10:10:38,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {59596#false} ~cond := #in~cond; {59596#false} is VALID
[2022-04-08 10:10:38,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {59596#false} assume 0 == ~cond; {59596#false} is VALID
[2022-04-08 10:10:38,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {59596#false} assume !false; {59596#false} is VALID
[2022-04-08 10:10:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:10:38,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:10:38,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008492111]
[2022-04-08 10:10:38,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008492111] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:10:38,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956349585]
[2022-04-08 10:10:38,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:10:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:38,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:10:38,623 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:10:38,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process
[2022-04-08 10:10:38,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:10:38,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:10:38,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core
[2022-04-08 10:10:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:38,675 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:10:38,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {59595#true} call ULTIMATE.init(); {59595#true} is VALID
[2022-04-08 10:10:38,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {59595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59595#true} is VALID
[2022-04-08 10:10:38,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {59595#true} assume true; {59595#true} is VALID
[2022-04-08 10:10:38,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59595#true} {59595#true} #61#return; {59595#true} is VALID
[2022-04-08 10:10:38,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {59595#true} call #t~ret11 := main(); {59595#true} is VALID
[2022-04-08 10:10:38,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {59595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59600#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:38,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {59600#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:38,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {59601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:38,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {59602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:38,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {59603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:38,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {59604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:38,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {59605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:38,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {59606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:38,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {59607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:38,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {59608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:38,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {59609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:38,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {59610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:38,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:38,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {59612#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:10:38,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {59612#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59613#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:10:38,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {59613#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:10:38,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {59614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59683#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:10:38,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {59683#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {59596#false} is VALID
[2022-04-08 10:10:38,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {59596#false} assume !(~y~0 % 4294967296 > 0); {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L272 TraceCheckUtils]: 35: Hoare triple {59596#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {59596#false} ~cond := #in~cond; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {59596#false} assume 0 == ~cond; {59596#false} is VALID
[2022-04-08 10:10:38,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {59596#false} assume !false; {59596#false} is VALID
[2022-04-08 10:10:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:10:38,939 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:10:39,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {59596#false} assume !false; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {59596#false} assume 0 == ~cond; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {59596#false} ~cond := #in~cond; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L272 TraceCheckUtils]: 35: Hoare triple {59596#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {59596#false} assume !(~y~0 % 4294967296 > 0); {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID
[2022-04-08 10:10:39,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {59783#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59596#false} is VALID
[2022-04-08 10:10:39,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {59787#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59783#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:10:39,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {59791#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59787#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:39,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {59795#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59791#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:10:39,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {59799#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {59795#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:10:39,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {59799#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59799#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:10:39,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {59806#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59799#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:10:39,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {59810#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59806#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:10:39,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {59814#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59810#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:39,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {59818#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59814#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:10:39,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {59822#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59818#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:10:39,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {59826#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59822#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:10:39,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {59830#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59826#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:10:39,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {59834#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59830#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:10:39,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {59838#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59834#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:39,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {59842#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59838#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:10:39,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {59846#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59842#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:39,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {59595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59846#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:10:39,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {59595#true} call #t~ret11 := main(); {59595#true} is VALID
[2022-04-08 10:10:39,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59595#true} {59595#true} #61#return; {59595#true} is VALID
[2022-04-08 10:10:39,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {59595#true} assume true; {59595#true} is VALID
[2022-04-08 10:10:39,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {59595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59595#true} is VALID
[2022-04-08 10:10:39,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {59595#true} call ULTIMATE.init(); {59595#true} is VALID
[2022-04-08 10:10:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:10:39,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956349585] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:10:39,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:10:39,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36
[2022-04-08 10:10:39,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:10:39,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [761473751]
[2022-04-08 10:10:39,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [761473751] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:10:39,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:10:39,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2022-04-08 10:10:39,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607770587]
[2022-04-08 10:10:39,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:10:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:39,409 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:10:39,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:39,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:39,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-08 10:10:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:39,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-08 10:10:39,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260
[2022-04-08 10:10:39,429 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:40,833 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions.
[2022-04-08 10:10:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2022-04-08 10:10:40,833 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:10:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions.
[2022-04-08 10:10:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions.
[2022-04-08 10:10:40,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 70 transitions.
[2022-04-08 10:10:40,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:40,889 INFO L225 Difference]: With dead ends: 158
[2022-04-08 10:10:40,889 INFO L226 Difference]: Without dead ends: 141
[2022-04-08 10:10:40,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=631, Invalid=2561, Unknown=0, NotChecked=0, Total=3192
[2022-04-08 10:10:40,890 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:10:40,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:10:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2022-04-08 10:10:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128.
[2022-04-08 10:10:41,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:10:41,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:41,040 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:41,040 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:41,041 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions.
[2022-04-08 10:10:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions.
[2022-04-08 10:10:41,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:41,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:41,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states.
[2022-04-08 10:10:41,041 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states.
[2022-04-08 10:10:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:41,042 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions.
[2022-04-08 10:10:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions.
[2022-04-08 10:10:41,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:41,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:41,043 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:10:41,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:10:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions.
[2022-04-08 10:10:41,044 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 39
[2022-04-08 10:10:41,044 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:10:41,044 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions.
[2022-04-08 10:10:41,044 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:41,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 162 transitions.
[2022-04-08 10:10:44,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions.
[2022-04-08 10:10:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2022-04-08 10:10:44,874 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:10:44,874 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:10:44,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0
[2022-04-08 10:10:45,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76
[2022-04-08 10:10:45,075 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:10:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:10:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1215567953, now seen corresponding path program 105 times
[2022-04-08 10:10:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:45,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [669416347]
[2022-04-08 10:10:45,077 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:10:45,077 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:10:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1215567953, now seen corresponding path program 106 times
[2022-04-08 10:10:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:10:45,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170158499]
[2022-04-08 10:10:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:10:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:10:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:10:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:45,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {60783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {60763#true} is VALID
[2022-04-08 10:10:45,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {60763#true} assume true; {60763#true} is VALID
[2022-04-08 10:10:45,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60763#true} {60763#true} #61#return; {60763#true} is VALID
[2022-04-08 10:10:45,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {60763#true} call ULTIMATE.init(); {60783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:10:45,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {60783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {60763#true} is VALID
[2022-04-08 10:10:45,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {60763#true} assume true; {60763#true} is VALID
[2022-04-08 10:10:45,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60763#true} {60763#true} #61#return; {60763#true} is VALID
[2022-04-08 10:10:45,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {60763#true} call #t~ret11 := main(); {60763#true} is VALID
[2022-04-08 10:10:45,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {60763#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60768#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:45,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {60768#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60769#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:45,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {60769#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:45,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {60770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60771#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:45,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {60771#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60772#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:45,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {60772#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60773#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:45,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {60773#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60774#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:45,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {60774#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:45,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {60775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60776#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:45,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {60776#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:45,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {60777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60778#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:45,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {60778#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60779#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:45,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {60779#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:10:45,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:10:45,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {60781#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:10:45,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {60781#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {60782#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {60782#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {60764#false} assume !(~y~0 % 4294967296 > 0); {60764#false} is VALID
[2022-04-08 10:10:45,315 INFO L272 TraceCheckUtils]: 35: Hoare triple {60764#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {60764#false} is VALID
[2022-04-08 10:10:45,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {60764#false} ~cond := #in~cond; {60764#false} is VALID
[2022-04-08 10:10:45,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {60764#false} assume 0 == ~cond; {60764#false} is VALID
[2022-04-08 10:10:45,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {60764#false} assume !false; {60764#false} is VALID
[2022-04-08 10:10:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:10:45,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:10:45,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170158499]
[2022-04-08 10:10:45,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170158499] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:10:45,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106952903]
[2022-04-08 10:10:45,316 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:10:45,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:45,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:10:45,317 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:10:45,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process
[2022-04-08 10:10:45,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:10:45,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:10:45,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 31 conjunts are in the unsatisfiable core
[2022-04-08 10:10:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:45,370 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:10:45,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {60763#true} call ULTIMATE.init(); {60763#true} is VALID
[2022-04-08 10:10:45,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {60763#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {60763#true} is VALID
[2022-04-08 10:10:45,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {60763#true} assume true; {60763#true} is VALID
[2022-04-08 10:10:45,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60763#true} {60763#true} #61#return; {60763#true} is VALID
[2022-04-08 10:10:45,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {60763#true} call #t~ret11 := main(); {60763#true} is VALID
[2022-04-08 10:10:45,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {60763#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60768#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:45,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {60768#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60769#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:45,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {60769#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:45,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {60770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60771#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:45,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {60771#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60772#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:45,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {60772#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60773#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:45,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {60773#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60774#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:45,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {60774#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:45,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {60775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60776#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:45,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {60776#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:45,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {60777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60778#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:45,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {60778#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60779#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:45,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {60779#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:10:45,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:10:45,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {60781#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:10:45,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {60781#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {60847#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:10:45,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {60847#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {60764#false} is VALID
[2022-04-08 10:10:45,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {60764#false} assume !(~y~0 % 4294967296 > 0); {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L272 TraceCheckUtils]: 35: Hoare triple {60764#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {60764#false} ~cond := #in~cond; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {60764#false} assume 0 == ~cond; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {60764#false} assume !false; {60764#false} is VALID
[2022-04-08 10:10:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:10:45,623 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:10:46,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {60764#false} assume !false; {60764#false} is VALID
[2022-04-08 10:10:46,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {60764#false} assume 0 == ~cond; {60764#false} is VALID
[2022-04-08 10:10:46,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {60764#false} ~cond := #in~cond; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L272 TraceCheckUtils]: 35: Hoare triple {60764#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {60764#false} assume !(~y~0 % 4294967296 > 0); {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID
[2022-04-08 10:10:46,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {60953#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {60764#false} is VALID
[2022-04-08 10:10:46,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {60957#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {60953#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:10:46,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {60961#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {60957#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:46,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {60961#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {60961#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:46,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {60968#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60961#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:10:46,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {60972#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60968#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:10:46,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {60976#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60972#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:10:46,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {60980#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60976#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:10:46,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {60984#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60980#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:10:46,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {60988#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60984#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:10:46,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {60992#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60988#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:46,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {60996#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60992#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:10:46,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {61000#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60996#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:46,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {61004#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61000#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:10:46,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {61008#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61004#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:10:46,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {61012#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61008#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:10:46,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {60763#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61012#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:10:46,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {60763#true} call #t~ret11 := main(); {60763#true} is VALID
[2022-04-08 10:10:46,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60763#true} {60763#true} #61#return; {60763#true} is VALID
[2022-04-08 10:10:46,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {60763#true} assume true; {60763#true} is VALID
[2022-04-08 10:10:46,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {60763#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {60763#true} is VALID
[2022-04-08 10:10:46,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {60763#true} call ULTIMATE.init(); {60763#true} is VALID
[2022-04-08 10:10:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:10:46,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106952903] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:10:46,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:10:46,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34
[2022-04-08 10:10:46,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:10:46,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [669416347]
[2022-04-08 10:10:46,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [669416347] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:10:46,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:10:46,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-04-08 10:10:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338080974]
[2022-04-08 10:10:46,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:10:46,051 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:46,051 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:10:46,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:46,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:46,068 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-04-08 10:10:46,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-04-08 10:10:46,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122
[2022-04-08 10:10:46,069 INFO L87 Difference]: Start difference. First operand 128 states and 162 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:47,499 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions.
[2022-04-08 10:10:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2022-04-08 10:10:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:10:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions.
[2022-04-08 10:10:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions.
[2022-04-08 10:10:47,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 70 transitions.
[2022-04-08 10:10:47,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:47,567 INFO L225 Difference]: With dead ends: 161
[2022-04-08 10:10:47,567 INFO L226 Difference]: Without dead ends: 143
[2022-04-08 10:10:47,568 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450
[2022-04-08 10:10:47,568 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:10:47,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 99 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:10:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states.
[2022-04-08 10:10:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129.
[2022-04-08 10:10:47,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:10:47,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:47,711 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:47,711 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:47,712 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions.
[2022-04-08 10:10:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions.
[2022-04-08 10:10:47,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:47,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:47,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states.
[2022-04-08 10:10:47,713 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states.
[2022-04-08 10:10:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:47,714 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions.
[2022-04-08 10:10:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions.
[2022-04-08 10:10:47,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:47,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:47,714 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:10:47,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:10:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions.
[2022-04-08 10:10:47,716 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 163 transitions. Word has length 39
[2022-04-08 10:10:47,716 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:10:47,716 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 163 transitions.
[2022-04-08 10:10:47,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:47,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 163 transitions.
[2022-04-08 10:10:50,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 162 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions.
[2022-04-08 10:10:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2022-04-08 10:10:50,946 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:10:50,946 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:10:50,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0
[2022-04-08 10:10:51,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:51,146 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:10:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:10:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1654406958, now seen corresponding path program 49 times
[2022-04-08 10:10:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:51,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299869504]
[2022-04-08 10:10:51,149 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:10:51,149 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:10:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1654406958, now seen corresponding path program 50 times
[2022-04-08 10:10:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:10:51,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636032061]
[2022-04-08 10:10:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:10:51,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:10:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:51,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:10:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:51,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {61963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61931#true} is VALID
[2022-04-08 10:10:51,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {61931#true} assume true; {61931#true} is VALID
[2022-04-08 10:10:51,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61931#true} {61931#true} #61#return; {61931#true} is VALID
[2022-04-08 10:10:51,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {61931#true} call ULTIMATE.init(); {61963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:10:51,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {61963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61931#true} is VALID
[2022-04-08 10:10:51,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {61931#true} assume true; {61931#true} is VALID
[2022-04-08 10:10:51,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61931#true} {61931#true} #61#return; {61931#true} is VALID
[2022-04-08 10:10:51,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {61931#true} call #t~ret11 := main(); {61931#true} is VALID
[2022-04-08 10:10:51,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {61931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61936#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:51,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {61936#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:51,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {61937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:51,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {61938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61939#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:51,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {61939#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61940#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:51,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {61940#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61941#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:51,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {61941#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61942#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:51,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {61942#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61943#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:51,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {61943#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61944#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:51,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {61944#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61945#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:51,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {61945#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61946#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:51,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {61946#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61947#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:51,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {61947#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61948#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:10:51,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {61948#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61949#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:10:51,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {61949#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61950#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:10:51,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {61950#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61951#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:10:51,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {61951#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61952#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:10:51,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {61952#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61953#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:10:51,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {61953#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61954#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:10:51,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {61954#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61955#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:10:51,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {61955#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61956#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:10:51,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {61956#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61957#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:10:51,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {61957#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61958#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:10:51,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {61958#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61959#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:10:51,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {61959#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61960#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:10:51,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {61960#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:10:51,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:10:51,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {61962#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:10:51,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {61962#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {61932#false} is VALID
[2022-04-08 10:10:51,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {61932#false} assume !(~y~0 % 4294967296 > 0); {61932#false} is VALID
[2022-04-08 10:10:51,659 INFO L272 TraceCheckUtils]: 35: Hoare triple {61932#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61932#false} is VALID
[2022-04-08 10:10:51,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {61932#false} ~cond := #in~cond; {61932#false} is VALID
[2022-04-08 10:10:51,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {61932#false} assume 0 == ~cond; {61932#false} is VALID
[2022-04-08 10:10:51,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {61932#false} assume !false; {61932#false} is VALID
[2022-04-08 10:10:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:10:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:10:51,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636032061]
[2022-04-08 10:10:51,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636032061] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:10:51,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212209287]
[2022-04-08 10:10:51,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:10:51,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:10:51,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:10:51,660 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:10:51,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process
[2022-04-08 10:10:51,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:10:51,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:10:51,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 55 conjunts are in the unsatisfiable core
[2022-04-08 10:10:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:10:51,713 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:10:52,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {61931#true} call ULTIMATE.init(); {61931#true} is VALID
[2022-04-08 10:10:52,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {61931#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61931#true} is VALID
[2022-04-08 10:10:52,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {61931#true} assume true; {61931#true} is VALID
[2022-04-08 10:10:52,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61931#true} {61931#true} #61#return; {61931#true} is VALID
[2022-04-08 10:10:52,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {61931#true} call #t~ret11 := main(); {61931#true} is VALID
[2022-04-08 10:10:52,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {61931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61936#(= main_~y~0 0)} is VALID
[2022-04-08 10:10:52,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {61936#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:10:52,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {61937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:10:52,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {61938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61939#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:10:52,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {61939#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61940#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:10:52,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {61940#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61941#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:10:52,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {61941#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61942#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:10:52,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {61942#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61943#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:10:52,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {61943#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61944#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:10:52,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {61944#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61945#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:10:52,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {61945#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61946#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:10:52,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {61946#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61947#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:10:52,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {61947#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61948#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:10:52,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {61948#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61949#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:10:52,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {61949#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61950#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:10:52,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {61950#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61951#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:10:52,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {61951#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61952#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:10:52,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {61952#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61953#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:10:52,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {61953#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61954#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:10:52,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {61954#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61955#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:10:52,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {61955#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61956#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:10:52,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {61956#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61957#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:10:52,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {61957#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61958#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:10:52,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {61958#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61959#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:10:52,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {61959#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61960#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:10:52,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {61960#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:10:52,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:10:52,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {62063#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID
[2022-04-08 10:10:52,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {62063#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 > 0); {61932#false} is VALID
[2022-04-08 10:10:52,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {61932#false} assume !(~y~0 % 4294967296 > 0); {61932#false} is VALID
[2022-04-08 10:10:52,078 INFO L272 TraceCheckUtils]: 35: Hoare triple {61932#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61932#false} is VALID
[2022-04-08 10:10:52,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {61932#false} ~cond := #in~cond; {61932#false} is VALID
[2022-04-08 10:10:52,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {61932#false} assume 0 == ~cond; {61932#false} is VALID
[2022-04-08 10:10:52,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {61932#false} assume !false; {61932#false} is VALID
[2022-04-08 10:10:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:10:52,078 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:10:53,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {61932#false} assume !false; {61932#false} is VALID
[2022-04-08 10:10:53,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {61932#false} assume 0 == ~cond; {61932#false} is VALID
[2022-04-08 10:10:53,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {61932#false} ~cond := #in~cond; {61932#false} is VALID
[2022-04-08 10:10:53,241 INFO L272 TraceCheckUtils]: 35: Hoare triple {61932#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61932#false} is VALID
[2022-04-08 10:10:53,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {61932#false} assume !(~y~0 % 4294967296 > 0); {61932#false} is VALID
[2022-04-08 10:10:53,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {62097#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {61932#false} is VALID
[2022-04-08 10:10:53,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {62101#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {62097#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:10:53,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {62101#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {62101#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:10:53,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {62108#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62101#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:10:53,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {62112#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62108#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:10:53,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {62116#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62112#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:10:53,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {62120#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62116#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:10:53,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {62124#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62120#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:10:53,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {62128#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62124#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:53,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {62132#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62128#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:10:53,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {62136#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62132#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:53,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {62140#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62136#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:10:53,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {62144#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62140#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:10:53,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {62148#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62144#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:10:53,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {62152#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62148#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:10:53,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {62156#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62152#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:10:53,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {62160#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62156#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:10:53,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {62164#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62160#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:10:53,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {62168#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62164#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:10:53,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {62172#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62168#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:10:53,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {62176#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62172#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:10:53,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {62180#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62176#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:10:53,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {62184#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62180#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:53,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {62188#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62184#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:10:53,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {62192#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62188#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID
[2022-04-08 10:10:53,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {62196#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62192#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID
[2022-04-08 10:10:53,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {62200#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62196#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:10:53,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {62204#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62200#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID
[2022-04-08 10:10:53,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {61931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62204#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID
[2022-04-08 10:10:53,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {61931#true} call #t~ret11 := main(); {61931#true} is VALID
[2022-04-08 10:10:53,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61931#true} {61931#true} #61#return; {61931#true} is VALID
[2022-04-08 10:10:53,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {61931#true} assume true; {61931#true} is VALID
[2022-04-08 10:10:53,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {61931#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61931#true} is VALID
[2022-04-08 10:10:53,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {61931#true} call ULTIMATE.init(); {61931#true} is VALID
[2022-04-08 10:10:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:10:53,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212209287] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:10:53,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:10:53,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58
[2022-04-08 10:10:53,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:10:53,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299869504]
[2022-04-08 10:10:53,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299869504] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:10:53,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:10:53,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30
[2022-04-08 10:10:53,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654882162]
[2022-04-08 10:10:53,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:10:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:53,260 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:10:53,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:53,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:53,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2022-04-08 10:10:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:10:53,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2022-04-08 10:10:53,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=2515, Unknown=0, NotChecked=0, Total=3306
[2022-04-08 10:10:53,283 INFO L87 Difference]: Start difference. First operand 129 states and 163 transitions. Second operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:58,577 INFO L93 Difference]: Finished difference Result 166 states and 229 transitions.
[2022-04-08 10:10:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2022-04-08 10:10:58,577 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2022-04-08 10:10:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:10:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 172 transitions.
[2022-04-08 10:10:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 172 transitions.
[2022-04-08 10:10:58,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 172 transitions.
[2022-04-08 10:10:58,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:58,718 INFO L225 Difference]: With dead ends: 166
[2022-04-08 10:10:58,718 INFO L226 Difference]: Without dead ends: 160
[2022-04-08 10:10:58,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1603, Invalid=5537, Unknown=0, NotChecked=0, Total=7140
[2022-04-08 10:10:58,719 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 148 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3326 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:10:58,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 197 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3326 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2022-04-08 10:10:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2022-04-08 10:10:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134.
[2022-04-08 10:10:58,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:10:58,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:58,907 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:58,907 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:58,909 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions.
[2022-04-08 10:10:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 196 transitions.
[2022-04-08 10:10:58,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:58,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:58,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states.
[2022-04-08 10:10:58,909 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states.
[2022-04-08 10:10:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:10:58,911 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions.
[2022-04-08 10:10:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 196 transitions.
[2022-04-08 10:10:58,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:10:58,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:10:58,911 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:10:58,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:10:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions.
[2022-04-08 10:10:58,912 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 39
[2022-04-08 10:10:58,912 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:10:58,912 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions.
[2022-04-08 10:10:58,912 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:10:58,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 170 transitions.
[2022-04-08 10:10:59,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:10:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions.
[2022-04-08 10:10:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2022-04-08 10:10:59,839 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:10:59,840 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:10:59,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0
[2022-04-08 10:11:00,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:00,040 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:11:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:11:00,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1413810305, now seen corresponding path program 107 times
[2022-04-08 10:11:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:00,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229409050]
[2022-04-08 10:11:00,042 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:11:00,043 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:11:00,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1413810305, now seen corresponding path program 108 times
[2022-04-08 10:11:00,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:11:00,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764639700]
[2022-04-08 10:11:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:11:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:11:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:11:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:00,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {63223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63199#true} is VALID
[2022-04-08 10:11:00,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {63199#true} assume true; {63199#true} is VALID
[2022-04-08 10:11:00,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63199#true} {63199#true} #61#return; {63199#true} is VALID
[2022-04-08 10:11:00,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {63199#true} call ULTIMATE.init(); {63223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:11:00,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {63223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63199#true} is VALID
[2022-04-08 10:11:00,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {63199#true} assume true; {63199#true} is VALID
[2022-04-08 10:11:00,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63199#true} {63199#true} #61#return; {63199#true} is VALID
[2022-04-08 10:11:00,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {63199#true} call #t~ret11 := main(); {63199#true} is VALID
[2022-04-08 10:11:00,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {63199#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63204#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:00,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {63204#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63205#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:00,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {63205#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63206#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:00,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {63206#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63207#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:00,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {63207#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63208#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:00,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {63208#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63209#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:00,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {63209#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63210#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:00,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {63210#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63211#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:00,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {63211#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63212#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:00,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {63212#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {63214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:11:00,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {63214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:11:00,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {63215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:11:00,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {63216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:11:00,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {63217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:11:00,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {63218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63219#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:11:00,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {63219#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63220#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:11:00,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {63220#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63221#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:11:00,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {63221#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63222#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {63222#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {63200#false} assume !(~y~0 % 4294967296 > 0); {63200#false} is VALID
[2022-04-08 10:11:00,346 INFO L272 TraceCheckUtils]: 36: Hoare triple {63200#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {63200#false} is VALID
[2022-04-08 10:11:00,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {63200#false} ~cond := #in~cond; {63200#false} is VALID
[2022-04-08 10:11:00,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {63200#false} assume 0 == ~cond; {63200#false} is VALID
[2022-04-08 10:11:00,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {63200#false} assume !false; {63200#false} is VALID
[2022-04-08 10:11:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:11:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:11:00,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764639700]
[2022-04-08 10:11:00,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764639700] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:11:00,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054731662]
[2022-04-08 10:11:00,347 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:11:00,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:00,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:11:00,348 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:11:00,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process
[2022-04-08 10:11:00,476 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s)
[2022-04-08 10:11:00,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:11:00,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 56 conjunts are in the unsatisfiable core
[2022-04-08 10:11:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:00,487 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:11:00,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {63199#true} call ULTIMATE.init(); {63199#true} is VALID
[2022-04-08 10:11:00,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {63199#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63199#true} is VALID
[2022-04-08 10:11:00,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {63199#true} assume true; {63199#true} is VALID
[2022-04-08 10:11:00,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63199#true} {63199#true} #61#return; {63199#true} is VALID
[2022-04-08 10:11:00,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {63199#true} call #t~ret11 := main(); {63199#true} is VALID
[2022-04-08 10:11:00,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {63199#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63204#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:00,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {63204#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63205#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:00,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {63205#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63206#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:00,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {63206#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63207#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:00,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {63207#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63208#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:00,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {63208#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63209#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:00,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {63209#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63210#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:00,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {63210#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63211#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:00,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {63211#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63212#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:00,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {63212#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {63275#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {63275#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63279#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:11:00,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {63279#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63283#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {63283#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63287#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {63287#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63291#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {63291#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63295#(and (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {63295#(and (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63299#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {63299#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63303#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {63303#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63307#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {63307#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {63200#false} assume !(~y~0 % 4294967296 > 0); {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L272 TraceCheckUtils]: 36: Hoare triple {63200#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {63200#false} ~cond := #in~cond; {63200#false} is VALID
[2022-04-08 10:11:00,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {63200#false} assume 0 == ~cond; {63200#false} is VALID
[2022-04-08 10:11:00,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {63200#false} assume !false; {63200#false} is VALID
[2022-04-08 10:11:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:11:00,903 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:11:01,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {63200#false} assume !false; {63200#false} is VALID
[2022-04-08 10:11:01,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {63200#false} assume 0 == ~cond; {63200#false} is VALID
[2022-04-08 10:11:01,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {63200#false} ~cond := #in~cond; {63200#false} is VALID
[2022-04-08 10:11:01,572 INFO L272 TraceCheckUtils]: 36: Hoare triple {63200#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {63200#false} is VALID
[2022-04-08 10:11:01,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {63200#false} assume !(~y~0 % 4294967296 > 0); {63200#false} is VALID
[2022-04-08 10:11:01,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {63368#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID
[2022-04-08 10:11:01,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {63372#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63368#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:11:01,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {63376#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63372#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:11:01,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {63380#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63376#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:11:01,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {63384#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63380#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:11:01,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {63388#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63384#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:11:01,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {63392#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63388#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:11:01,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {63396#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63392#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:11:01,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {63400#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63396#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:11:01,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {63404#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {63400#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:11:01,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {63408#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63404#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:11:01,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {63412#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63408#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:11:01,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {63416#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63412#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:11:01,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {63420#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63416#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:11:01,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {63424#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63420#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:11:01,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {63428#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63424#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:11:01,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {63432#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63428#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {63436#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63432#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {63199#true} ~z~0 := ~y~0; {63436#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {63199#true} assume !(~x~0 % 4294967296 > 0); {63199#true} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {63199#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63199#true} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {63199#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63199#true} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {63199#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63199#true} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {63199#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63199#true} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {63199#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63199#true} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {63199#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63199#true} is VALID
[2022-04-08 10:11:01,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {63199#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63199#true} is VALID
[2022-04-08 10:11:01,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {63199#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63199#true} is VALID
[2022-04-08 10:11:01,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {63199#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63199#true} is VALID
[2022-04-08 10:11:01,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {63199#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63199#true} is VALID
[2022-04-08 10:11:01,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {63199#true} call #t~ret11 := main(); {63199#true} is VALID
[2022-04-08 10:11:01,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63199#true} {63199#true} #61#return; {63199#true} is VALID
[2022-04-08 10:11:01,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {63199#true} assume true; {63199#true} is VALID
[2022-04-08 10:11:01,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {63199#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63199#true} is VALID
[2022-04-08 10:11:01,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {63199#true} call ULTIMATE.init(); {63199#true} is VALID
[2022-04-08 10:11:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-04-08 10:11:01,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054731662] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:11:01,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:11:01,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 49
[2022-04-08 10:11:01,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:11:01,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229409050]
[2022-04-08 10:11:01,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229409050] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:11:01,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:11:01,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2022-04-08 10:11:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567433699]
[2022-04-08 10:11:01,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:11:01,591 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:01,591 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:11:01,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:01,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:01,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2022-04-08 10:11:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:01,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2022-04-08 10:11:01,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352
[2022-04-08 10:11:01,612 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:03,167 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions.
[2022-04-08 10:11:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-04-08 10:11:03,168 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:11:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions.
[2022-04-08 10:11:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions.
[2022-04-08 10:11:03,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 58 transitions.
[2022-04-08 10:11:03,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:03,214 INFO L225 Difference]: With dead ends: 161
[2022-04-08 10:11:03,214 INFO L226 Difference]: Without dead ends: 146
[2022-04-08 10:11:03,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=497, Invalid=4059, Unknown=0, NotChecked=0, Total=4556
[2022-04-08 10:11:03,214 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:11:03,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:11:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2022-04-08 10:11:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 135.
[2022-04-08 10:11:03,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:11:03,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:03,361 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:03,361 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:03,363 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions.
[2022-04-08 10:11:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions.
[2022-04-08 10:11:03,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:03,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:03,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 146 states.
[2022-04-08 10:11:03,363 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 146 states.
[2022-04-08 10:11:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:03,364 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions.
[2022-04-08 10:11:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions.
[2022-04-08 10:11:03,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:03,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:03,365 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:11:03,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:11:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions.
[2022-04-08 10:11:03,366 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 40
[2022-04-08 10:11:03,366 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:11:03,366 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 171 transitions.
[2022-04-08 10:11:03,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:03,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 171 transitions.
[2022-04-08 10:11:08,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 169 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions.
[2022-04-08 10:11:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2022-04-08 10:11:08,785 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:11:08,785 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:11:08,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0
[2022-04-08 10:11:08,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79
[2022-04-08 10:11:08,985 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:11:08,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:11:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -44794227, now seen corresponding path program 109 times
[2022-04-08 10:11:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:08,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961181431]
[2022-04-08 10:11:08,988 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:11:08,988 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:11:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -44794227, now seen corresponding path program 110 times
[2022-04-08 10:11:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:11:08,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942518689]
[2022-04-08 10:11:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:11:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:11:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:11:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:09,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {64435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64412#true} is VALID
[2022-04-08 10:11:09,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {64412#true} assume true; {64412#true} is VALID
[2022-04-08 10:11:09,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64412#true} {64412#true} #61#return; {64412#true} is VALID
[2022-04-08 10:11:09,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {64412#true} call ULTIMATE.init(); {64435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:11:09,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {64435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64412#true} is VALID
[2022-04-08 10:11:09,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {64412#true} assume true; {64412#true} is VALID
[2022-04-08 10:11:09,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64412#true} {64412#true} #61#return; {64412#true} is VALID
[2022-04-08 10:11:09,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {64412#true} call #t~ret11 := main(); {64412#true} is VALID
[2022-04-08 10:11:09,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {64412#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64417#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:09,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {64417#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64418#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:09,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {64418#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64419#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:09,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {64419#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64420#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:09,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {64420#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64421#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:09,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {64421#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64422#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:09,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {64422#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64423#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:09,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {64423#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64424#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:09,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {64424#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64425#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:09,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {64425#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64426#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:09,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {64426#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:09,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:09,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {64428#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:11:09,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {64428#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64429#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:11:09,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {64429#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64430#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:11:09,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {64430#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64431#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:11:09,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {64431#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64432#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:11:09,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {64432#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64433#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:11:09,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {64433#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64434#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {64434#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {64413#false} assume !(~y~0 % 4294967296 > 0); {64413#false} is VALID
[2022-04-08 10:11:09,273 INFO L272 TraceCheckUtils]: 36: Hoare triple {64413#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64413#false} is VALID
[2022-04-08 10:11:09,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {64413#false} ~cond := #in~cond; {64413#false} is VALID
[2022-04-08 10:11:09,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {64413#false} assume 0 == ~cond; {64413#false} is VALID
[2022-04-08 10:11:09,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {64413#false} assume !false; {64413#false} is VALID
[2022-04-08 10:11:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:11:09,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:11:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942518689]
[2022-04-08 10:11:09,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942518689] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:11:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823065713]
[2022-04-08 10:11:09,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:11:09,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:11:09,275 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:11:09,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process
[2022-04-08 10:11:09,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:11:09,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:11:09,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core
[2022-04-08 10:11:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:09,332 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:11:09,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {64412#true} call ULTIMATE.init(); {64412#true} is VALID
[2022-04-08 10:11:09,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {64412#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64412#true} is VALID
[2022-04-08 10:11:09,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {64412#true} assume true; {64412#true} is VALID
[2022-04-08 10:11:09,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64412#true} {64412#true} #61#return; {64412#true} is VALID
[2022-04-08 10:11:09,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {64412#true} call #t~ret11 := main(); {64412#true} is VALID
[2022-04-08 10:11:09,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {64412#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64417#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:09,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {64417#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64418#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:09,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {64418#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64419#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:09,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {64419#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64420#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:09,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {64420#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64421#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:09,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {64421#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64422#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:09,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {64422#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64423#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:09,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {64423#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64424#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:09,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {64424#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64425#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:09,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {64425#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64426#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:09,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {64426#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:09,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:09,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {64428#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:11:09,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {64428#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64429#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:11:09,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {64429#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64430#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:11:09,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {64430#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64431#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:11:09,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {64431#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64432#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:11:09,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {64432#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64433#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:11:09,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {64433#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64508#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {64508#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {64413#false} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:09,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {64413#false} assume !(~y~0 % 4294967296 > 0); {64413#false} is VALID
[2022-04-08 10:11:09,607 INFO L272 TraceCheckUtils]: 36: Hoare triple {64413#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64413#false} is VALID
[2022-04-08 10:11:09,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {64413#false} ~cond := #in~cond; {64413#false} is VALID
[2022-04-08 10:11:09,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {64413#false} assume 0 == ~cond; {64413#false} is VALID
[2022-04-08 10:11:09,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {64413#false} assume !false; {64413#false} is VALID
[2022-04-08 10:11:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:11:09,607 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:11:10,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {64413#false} assume !false; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {64413#false} assume 0 == ~cond; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 37: Hoare triple {64413#false} ~cond := #in~cond; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L272 TraceCheckUtils]: 36: Hoare triple {64413#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {64413#false} assume !(~y~0 % 4294967296 > 0); {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID
[2022-04-08 10:11:10,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {64602#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {64413#false} is VALID
[2022-04-08 10:11:10,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {64606#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64602#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:11:10,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {64610#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64606#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:11:10,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {64614#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64610#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:11:10,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {64618#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64614#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:11:10,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {64622#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64618#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:11:10,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {64626#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64622#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:11:10,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {64630#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {64626#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:11:10,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {64630#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {64630#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:10,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {64637#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64630#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:10,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {64641#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64637#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:10,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {64645#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64641#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:10,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {64649#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64645#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:11:10,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {64653#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64649#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:11:10,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {64657#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64653#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:11:10,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {64661#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64657#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:11:10,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {64665#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64661#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:11:10,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {64669#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64665#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:11:10,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {64673#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64669#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:11:10,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {64412#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64673#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:11:10,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {64412#true} call #t~ret11 := main(); {64412#true} is VALID
[2022-04-08 10:11:10,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64412#true} {64412#true} #61#return; {64412#true} is VALID
[2022-04-08 10:11:10,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {64412#true} assume true; {64412#true} is VALID
[2022-04-08 10:11:10,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {64412#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64412#true} is VALID
[2022-04-08 10:11:10,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {64412#true} call ULTIMATE.init(); {64412#true} is VALID
[2022-04-08 10:11:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:11:10,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823065713] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:11:10,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:11:10,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40
[2022-04-08 10:11:10,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:11:10,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961181431]
[2022-04-08 10:11:10,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961181431] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:11:10,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:11:10,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2022-04-08 10:11:10,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766351533]
[2022-04-08 10:11:10,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:11:10,160 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:10,160 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:11:10,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:10,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:10,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2022-04-08 10:11:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:10,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2022-04-08 10:11:10,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560
[2022-04-08 10:11:10,183 INFO L87 Difference]: Start difference. First operand 135 states and 171 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:11,954 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions.
[2022-04-08 10:11:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2022-04-08 10:11:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:11:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions.
[2022-04-08 10:11:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions.
[2022-04-08 10:11:11,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 68 transitions.
[2022-04-08 10:11:12,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:12,008 INFO L225 Difference]: With dead ends: 164
[2022-04-08 10:11:12,008 INFO L226 Difference]: Without dead ends: 148
[2022-04-08 10:11:12,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=730, Invalid=3302, Unknown=0, NotChecked=0, Total=4032
[2022-04-08 10:11:12,009 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:11:12,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:11:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2022-04-08 10:11:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136.
[2022-04-08 10:11:12,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:11:12,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:12,160 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:12,160 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:12,161 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions.
[2022-04-08 10:11:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions.
[2022-04-08 10:11:12,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:12,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:12,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 148 states.
[2022-04-08 10:11:12,162 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 148 states.
[2022-04-08 10:11:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:12,163 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions.
[2022-04-08 10:11:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions.
[2022-04-08 10:11:12,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:12,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:12,163 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:11:12,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:11:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions.
[2022-04-08 10:11:12,164 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 40
[2022-04-08 10:11:12,165 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:11:12,165 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions.
[2022-04-08 10:11:12,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:12,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 172 transitions.
[2022-04-08 10:11:14,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 171 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions.
[2022-04-08 10:11:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2022-04-08 10:11:14,978 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:11:14,978 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:11:14,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0
[2022-04-08 10:11:15,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:15,184 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:11:15,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:11:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1351548287, now seen corresponding path program 111 times
[2022-04-08 10:11:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:15,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [793910021]
[2022-04-08 10:11:15,186 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:11:15,187 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:11:15,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1351548287, now seen corresponding path program 112 times
[2022-04-08 10:11:15,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:11:15,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489541134]
[2022-04-08 10:11:15,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:11:15,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:11:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:11:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:15,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {65660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65638#true} is VALID
[2022-04-08 10:11:15,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {65638#true} assume true; {65638#true} is VALID
[2022-04-08 10:11:15,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65638#true} {65638#true} #61#return; {65638#true} is VALID
[2022-04-08 10:11:15,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {65638#true} call ULTIMATE.init(); {65660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:11:15,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {65660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65638#true} is VALID
[2022-04-08 10:11:15,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {65638#true} assume true; {65638#true} is VALID
[2022-04-08 10:11:15,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65638#true} {65638#true} #61#return; {65638#true} is VALID
[2022-04-08 10:11:15,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {65638#true} call #t~ret11 := main(); {65638#true} is VALID
[2022-04-08 10:11:15,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {65638#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65643#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:15,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {65643#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65644#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:15,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {65644#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65645#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:15,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {65645#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65646#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:15,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {65646#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65647#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:15,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {65647#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65648#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:15,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {65648#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65649#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:15,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {65649#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65650#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:15,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {65650#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65651#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:15,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {65651#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65652#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:15,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {65652#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65653#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:15,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {65653#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:11:15,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:11:15,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {65655#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:11:15,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {65655#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65656#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:11:15,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {65656#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65657#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:11:15,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {65657#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65658#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:11:15,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {65658#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65659#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {65659#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {65639#false} assume !(~y~0 % 4294967296 > 0); {65639#false} is VALID
[2022-04-08 10:11:15,457 INFO L272 TraceCheckUtils]: 36: Hoare triple {65639#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65639#false} is VALID
[2022-04-08 10:11:15,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {65639#false} ~cond := #in~cond; {65639#false} is VALID
[2022-04-08 10:11:15,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {65639#false} assume 0 == ~cond; {65639#false} is VALID
[2022-04-08 10:11:15,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {65639#false} assume !false; {65639#false} is VALID
[2022-04-08 10:11:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:11:15,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:11:15,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489541134]
[2022-04-08 10:11:15,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489541134] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:11:15,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825343559]
[2022-04-08 10:11:15,457 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:11:15,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:11:15,458 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:11:15,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process
[2022-04-08 10:11:15,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:11:15,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:11:15,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core
[2022-04-08 10:11:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:15,510 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:11:15,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {65638#true} call ULTIMATE.init(); {65638#true} is VALID
[2022-04-08 10:11:15,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {65638#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65638#true} is VALID
[2022-04-08 10:11:15,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {65638#true} assume true; {65638#true} is VALID
[2022-04-08 10:11:15,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65638#true} {65638#true} #61#return; {65638#true} is VALID
[2022-04-08 10:11:15,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {65638#true} call #t~ret11 := main(); {65638#true} is VALID
[2022-04-08 10:11:15,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {65638#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65643#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:15,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {65643#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65644#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:15,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {65644#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65645#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:15,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {65645#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65646#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:15,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {65646#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65647#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:15,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {65647#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65648#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:15,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {65648#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65649#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:15,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {65649#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65650#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:15,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {65650#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65651#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:15,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {65651#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65652#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:15,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {65652#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65653#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:15,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {65653#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:11:15,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:11:15,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {65655#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:11:15,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {65655#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65656#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:11:15,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {65656#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65657#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:11:15,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {65657#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65658#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:11:15,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {65658#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65730#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:11:15,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {65730#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {65639#false} is VALID
[2022-04-08 10:11:15,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:15,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {65639#false} assume !(~y~0 % 4294967296 > 0); {65639#false} is VALID
[2022-04-08 10:11:15,783 INFO L272 TraceCheckUtils]: 36: Hoare triple {65639#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65639#false} is VALID
[2022-04-08 10:11:15,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {65639#false} ~cond := #in~cond; {65639#false} is VALID
[2022-04-08 10:11:15,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {65639#false} assume 0 == ~cond; {65639#false} is VALID
[2022-04-08 10:11:15,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {65639#false} assume !false; {65639#false} is VALID
[2022-04-08 10:11:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:11:15,783 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:11:16,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {65639#false} assume !false; {65639#false} is VALID
[2022-04-08 10:11:16,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {65639#false} assume 0 == ~cond; {65639#false} is VALID
[2022-04-08 10:11:16,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {65639#false} ~cond := #in~cond; {65639#false} is VALID
[2022-04-08 10:11:16,284 INFO L272 TraceCheckUtils]: 36: Hoare triple {65639#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65639#false} is VALID
[2022-04-08 10:11:16,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {65639#false} assume !(~y~0 % 4294967296 > 0); {65639#false} is VALID
[2022-04-08 10:11:16,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID
[2022-04-08 10:11:16,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {65830#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {65639#false} is VALID
[2022-04-08 10:11:16,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {65834#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65830#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:11:16,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {65838#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65834#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:11:16,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {65842#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65838#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:11:16,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {65846#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65842#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:11:16,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {65850#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {65846#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:11:16,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {65850#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {65850#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:16,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {65857#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65850#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:16,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {65861#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65857#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:11:16,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {65865#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65861#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:11:16,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {65869#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65865#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:11:16,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {65873#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65869#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:11:16,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {65877#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65873#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:11:16,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {65881#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65877#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:11:16,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {65885#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65881#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:11:16,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {65889#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65885#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:11:16,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {65893#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65889#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:16,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {65897#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65893#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:11:16,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {65638#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65897#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:16,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {65638#true} call #t~ret11 := main(); {65638#true} is VALID
[2022-04-08 10:11:16,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65638#true} {65638#true} #61#return; {65638#true} is VALID
[2022-04-08 10:11:16,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {65638#true} assume true; {65638#true} is VALID
[2022-04-08 10:11:16,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {65638#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {65638#true} is VALID
[2022-04-08 10:11:16,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {65638#true} call ULTIMATE.init(); {65638#true} is VALID
[2022-04-08 10:11:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:11:16,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825343559] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:11:16,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:11:16,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38
[2022-04-08 10:11:16,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:11:16,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [793910021]
[2022-04-08 10:11:16,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [793910021] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:11:16,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:11:16,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-04-08 10:11:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919112274]
[2022-04-08 10:11:16,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:11:16,298 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:16,298 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:11:16,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:16,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:16,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-04-08 10:11:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:16,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-04-08 10:11:16,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406
[2022-04-08 10:11:16,317 INFO L87 Difference]: Start difference. First operand 136 states and 172 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:18,016 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions.
[2022-04-08 10:11:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2022-04-08 10:11:18,016 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:11:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions.
[2022-04-08 10:11:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions.
[2022-04-08 10:11:18,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 73 transitions.
[2022-04-08 10:11:18,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:18,074 INFO L225 Difference]: With dead ends: 167
[2022-04-08 10:11:18,074 INFO L226 Difference]: Without dead ends: 150
[2022-04-08 10:11:18,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=3054, Unknown=0, NotChecked=0, Total=3782
[2022-04-08 10:11:18,075 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:11:18,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 97 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:11:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2022-04-08 10:11:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137.
[2022-04-08 10:11:18,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:11:18,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:18,225 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:18,225 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:18,226 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions.
[2022-04-08 10:11:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions.
[2022-04-08 10:11:18,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:18,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:18,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states.
[2022-04-08 10:11:18,227 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states.
[2022-04-08 10:11:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:18,228 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions.
[2022-04-08 10:11:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions.
[2022-04-08 10:11:18,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:18,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:18,228 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:11:18,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:11:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions.
[2022-04-08 10:11:18,230 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 40
[2022-04-08 10:11:18,230 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:11:18,230 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions.
[2022-04-08 10:11:18,230 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:18,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions.
[2022-04-08 10:11:22,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 172 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions.
[2022-04-08 10:11:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2022-04-08 10:11:22,063 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:11:22,063 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:11:22,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0
[2022-04-08 10:11:22,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:22,264 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:11:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:11:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -605310835, now seen corresponding path program 113 times
[2022-04-08 10:11:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:22,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277560040]
[2022-04-08 10:11:22,266 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:11:22,266 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:11:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -605310835, now seen corresponding path program 114 times
[2022-04-08 10:11:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:11:22,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026151073]
[2022-04-08 10:11:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:11:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:11:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:11:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:22,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {66895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66874#true} is VALID
[2022-04-08 10:11:22,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {66874#true} assume true; {66874#true} is VALID
[2022-04-08 10:11:22,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66874#true} {66874#true} #61#return; {66874#true} is VALID
[2022-04-08 10:11:22,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {66874#true} call ULTIMATE.init(); {66895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:11:22,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {66895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66874#true} is VALID
[2022-04-08 10:11:22,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {66874#true} assume true; {66874#true} is VALID
[2022-04-08 10:11:22,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66874#true} {66874#true} #61#return; {66874#true} is VALID
[2022-04-08 10:11:22,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {66874#true} call #t~ret11 := main(); {66874#true} is VALID
[2022-04-08 10:11:22,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {66874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66879#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:22,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {66879#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:22,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {66880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:22,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {66881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:22,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {66882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:22,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {66883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:22,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {66884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:22,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {66885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:22,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {66886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:22,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {66887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:22,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {66888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:22,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {66889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:11:22,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {66890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:11:22,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:11:22,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {66892#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:11:22,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {66892#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66893#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:11:22,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {66893#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66894#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {66894#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:22,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {66875#false} assume !(~y~0 % 4294967296 > 0); {66875#false} is VALID
[2022-04-08 10:11:22,520 INFO L272 TraceCheckUtils]: 36: Hoare triple {66875#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66875#false} is VALID
[2022-04-08 10:11:22,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {66875#false} ~cond := #in~cond; {66875#false} is VALID
[2022-04-08 10:11:22,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {66875#false} assume 0 == ~cond; {66875#false} is VALID
[2022-04-08 10:11:22,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {66875#false} assume !false; {66875#false} is VALID
[2022-04-08 10:11:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:11:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:11:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026151073]
[2022-04-08 10:11:22,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026151073] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:11:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198226866]
[2022-04-08 10:11:22,520 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:11:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:22,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:11:22,521 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:11:22,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process
[2022-04-08 10:11:22,976 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2022-04-08 10:11:22,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:11:22,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core
[2022-04-08 10:11:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:22,987 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:11:23,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {66874#true} call ULTIMATE.init(); {66874#true} is VALID
[2022-04-08 10:11:23,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {66874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66874#true} is VALID
[2022-04-08 10:11:23,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {66874#true} assume true; {66874#true} is VALID
[2022-04-08 10:11:23,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66874#true} {66874#true} #61#return; {66874#true} is VALID
[2022-04-08 10:11:23,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {66874#true} call #t~ret11 := main(); {66874#true} is VALID
[2022-04-08 10:11:23,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {66874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66879#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:23,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {66879#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:23,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {66880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:23,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {66881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:23,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {66882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:23,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {66883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:23,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {66884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:23,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {66885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:23,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {66886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:23,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {66887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:23,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {66888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:23,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {66889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:11:23,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {66890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:11:23,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:11:23,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {66892#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:11:23,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {66892#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66893#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:11:23,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {66893#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66962#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {66962#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {66875#false} assume !(~y~0 % 4294967296 > 0); {66875#false} is VALID
[2022-04-08 10:11:23,255 INFO L272 TraceCheckUtils]: 36: Hoare triple {66875#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66875#false} is VALID
[2022-04-08 10:11:23,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {66875#false} ~cond := #in~cond; {66875#false} is VALID
[2022-04-08 10:11:23,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {66875#false} assume 0 == ~cond; {66875#false} is VALID
[2022-04-08 10:11:23,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {66875#false} assume !false; {66875#false} is VALID
[2022-04-08 10:11:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:11:23,255 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {66875#false} assume !false; {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {66875#false} assume 0 == ~cond; {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {66875#false} ~cond := #in~cond; {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L272 TraceCheckUtils]: 36: Hoare triple {66875#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {66875#false} assume !(~y~0 % 4294967296 > 0); {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID
[2022-04-08 10:11:23,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {67068#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66875#false} is VALID
[2022-04-08 10:11:23,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {67072#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67068#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:11:23,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {67076#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67072#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:11:23,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {67080#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {67076#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:11:23,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {67080#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {67080#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:11:23,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {67087#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67080#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:11:23,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {67091#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67087#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:11:23,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {67095#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67091#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:11:23,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {67099#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67095#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:11:23,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {67103#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67099#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:11:23,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {67107#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67103#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:11:23,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {67111#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67107#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:11:23,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {67115#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67111#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:23,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {67119#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67115#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:11:23,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {67123#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67119#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:23,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {67127#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67123#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:11:23,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {67131#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67127#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:11:23,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {66874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67131#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:11:23,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {66874#true} call #t~ret11 := main(); {66874#true} is VALID
[2022-04-08 10:11:23,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66874#true} {66874#true} #61#return; {66874#true} is VALID
[2022-04-08 10:11:23,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {66874#true} assume true; {66874#true} is VALID
[2022-04-08 10:11:23,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {66874#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {66874#true} is VALID
[2022-04-08 10:11:23,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {66874#true} call ULTIMATE.init(); {66874#true} is VALID
[2022-04-08 10:11:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:11:23,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198226866] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:11:23,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:11:23,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36
[2022-04-08 10:11:23,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:11:23,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277560040]
[2022-04-08 10:11:23,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277560040] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:11:23,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:11:23,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2022-04-08 10:11:23,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272686065]
[2022-04-08 10:11:23,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:11:23,735 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:23,735 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:11:23,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:23,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:23,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-08 10:11:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:23,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-08 10:11:23,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260
[2022-04-08 10:11:23,755 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:25,305 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions.
[2022-04-08 10:11:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-04-08 10:11:25,305 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:11:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions.
[2022-04-08 10:11:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions.
[2022-04-08 10:11:25,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 73 transitions.
[2022-04-08 10:11:25,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:25,367 INFO L225 Difference]: With dead ends: 170
[2022-04-08 10:11:25,367 INFO L226 Difference]: Without dead ends: 152
[2022-04-08 10:11:25,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970
[2022-04-08 10:11:25,368 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:11:25,368 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 95 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:11:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2022-04-08 10:11:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138.
[2022-04-08 10:11:25,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:11:25,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:25,519 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:25,520 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:25,521 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions.
[2022-04-08 10:11:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions.
[2022-04-08 10:11:25,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:25,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:25,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 152 states.
[2022-04-08 10:11:25,522 INFO L87 Difference]: Start difference. First operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 152 states.
[2022-04-08 10:11:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:25,523 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions.
[2022-04-08 10:11:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions.
[2022-04-08 10:11:25,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:25,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:25,523 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:11:25,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:11:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions.
[2022-04-08 10:11:25,525 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 40
[2022-04-08 10:11:25,525 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:11:25,525 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions.
[2022-04-08 10:11:25,525 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:25,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 174 transitions.
[2022-04-08 10:11:30,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 172 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions.
[2022-04-08 10:11:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2022-04-08 10:11:30,224 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:11:30,224 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:11:30,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0
[2022-04-08 10:11:30,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82
[2022-04-08 10:11:30,425 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:11:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:11:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash 599864045, now seen corresponding path program 51 times
[2022-04-08 10:11:30,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:30,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213031488]
[2022-04-08 10:11:30,427 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:11:30,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:11:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash 599864045, now seen corresponding path program 52 times
[2022-04-08 10:11:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:11:30,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970239586]
[2022-04-08 10:11:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:11:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:11:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:30,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:11:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:30,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {68143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {68110#true} is VALID
[2022-04-08 10:11:30,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {68110#true} assume true; {68110#true} is VALID
[2022-04-08 10:11:30,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68110#true} {68110#true} #61#return; {68110#true} is VALID
[2022-04-08 10:11:30,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {68110#true} call ULTIMATE.init(); {68143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:11:30,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {68143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {68110#true} is VALID
[2022-04-08 10:11:30,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {68110#true} assume true; {68110#true} is VALID
[2022-04-08 10:11:30,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68110#true} {68110#true} #61#return; {68110#true} is VALID
[2022-04-08 10:11:30,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {68110#true} call #t~ret11 := main(); {68110#true} is VALID
[2022-04-08 10:11:30,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {68110#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68115#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:30,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {68115#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:30,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {68116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:30,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {68117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:30,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {68118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:30,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {68119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:30,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {68120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:30,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {68121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:30,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {68122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:30,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {68123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:30,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {68124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:30,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {68125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:11:30,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {68126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:11:30,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {68127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:11:30,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {68128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:11:30,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {68129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:11:30,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {68130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:11:30,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {68131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:11:30,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {68132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:11:30,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {68133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:11:30,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {68134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:11:30,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {68135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:11:30,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {68136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:11:30,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {68137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:11:30,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {68138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:11:30,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {68139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:11:30,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {68140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:11:30,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:11:30,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {68142#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} is VALID
[2022-04-08 10:11:30,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {68142#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {68111#false} is VALID
[2022-04-08 10:11:30,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {68111#false} assume !(~y~0 % 4294967296 > 0); {68111#false} is VALID
[2022-04-08 10:11:30,955 INFO L272 TraceCheckUtils]: 36: Hoare triple {68111#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {68111#false} is VALID
[2022-04-08 10:11:30,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {68111#false} ~cond := #in~cond; {68111#false} is VALID
[2022-04-08 10:11:30,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {68111#false} assume 0 == ~cond; {68111#false} is VALID
[2022-04-08 10:11:30,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {68111#false} assume !false; {68111#false} is VALID
[2022-04-08 10:11:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:11:30,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:11:30,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970239586]
[2022-04-08 10:11:30,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970239586] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:11:30,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425464536]
[2022-04-08 10:11:30,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:11:30,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:30,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:11:30,957 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:11:30,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process
[2022-04-08 10:11:31,000 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:11:31,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:11:31,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 57 conjunts are in the unsatisfiable core
[2022-04-08 10:11:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:31,010 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:11:31,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {68110#true} call ULTIMATE.init(); {68110#true} is VALID
[2022-04-08 10:11:31,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {68110#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {68110#true} is VALID
[2022-04-08 10:11:31,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {68110#true} assume true; {68110#true} is VALID
[2022-04-08 10:11:31,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68110#true} {68110#true} #61#return; {68110#true} is VALID
[2022-04-08 10:11:31,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {68110#true} call #t~ret11 := main(); {68110#true} is VALID
[2022-04-08 10:11:31,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {68110#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68115#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:31,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {68115#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:31,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {68116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:31,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {68117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:31,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {68118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:31,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {68119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:31,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {68120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:31,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {68121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:31,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {68122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:31,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {68123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:31,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {68124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:31,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {68125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:11:31,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {68126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:11:31,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {68127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:11:31,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {68128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:11:31,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {68129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:11:31,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {68130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:11:31,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {68131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:11:31,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {68132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:11:31,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {68133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:11:31,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {68134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:11:31,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {68135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:11:31,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {68136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:11:31,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {68137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:11:31,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {68138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:11:31,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {68139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:11:31,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {68140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:11:31,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:11:31,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {68246#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID
[2022-04-08 10:11:31,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {68246#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {68111#false} is VALID
[2022-04-08 10:11:31,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {68111#false} assume !(~y~0 % 4294967296 > 0); {68111#false} is VALID
[2022-04-08 10:11:31,373 INFO L272 TraceCheckUtils]: 36: Hoare triple {68111#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {68111#false} is VALID
[2022-04-08 10:11:31,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {68111#false} ~cond := #in~cond; {68111#false} is VALID
[2022-04-08 10:11:31,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {68111#false} assume 0 == ~cond; {68111#false} is VALID
[2022-04-08 10:11:31,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {68111#false} assume !false; {68111#false} is VALID
[2022-04-08 10:11:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:11:31,373 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:11:32,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {68111#false} assume !false; {68111#false} is VALID
[2022-04-08 10:11:32,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {68111#false} assume 0 == ~cond; {68111#false} is VALID
[2022-04-08 10:11:32,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {68111#false} ~cond := #in~cond; {68111#false} is VALID
[2022-04-08 10:11:32,635 INFO L272 TraceCheckUtils]: 36: Hoare triple {68111#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {68111#false} is VALID
[2022-04-08 10:11:32,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {68111#false} assume !(~y~0 % 4294967296 > 0); {68111#false} is VALID
[2022-04-08 10:11:32,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {68280#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {68111#false} is VALID
[2022-04-08 10:11:32,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {68284#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {68280#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:11:32,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {68284#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {68284#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:11:32,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {68291#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68284#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:11:32,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {68295#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68291#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:11:32,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {68299#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68295#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:11:32,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {68303#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68299#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:11:32,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {68307#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68303#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:11:32,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {68311#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68307#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:32,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {68315#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68311#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:11:32,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {68319#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68315#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:32,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {68323#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68319#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:11:32,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {68327#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68323#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:11:32,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {68331#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68327#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:11:32,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {68335#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68331#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:11:32,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {68339#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68335#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:11:32,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {68343#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68339#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:11:32,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {68347#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68343#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:11:32,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {68351#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68347#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:11:32,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {68355#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68351#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:11:32,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {68359#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68355#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:11:32,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {68363#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68359#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:11:32,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {68367#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68363#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:32,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {68371#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68367#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:11:32,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {68375#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68371#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID
[2022-04-08 10:11:32,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {68379#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68375#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID
[2022-04-08 10:11:32,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {68383#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68379#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:11:32,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {68387#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68383#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID
[2022-04-08 10:11:32,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {68391#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68387#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID
[2022-04-08 10:11:32,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {68110#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68391#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID
[2022-04-08 10:11:32,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {68110#true} call #t~ret11 := main(); {68110#true} is VALID
[2022-04-08 10:11:32,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68110#true} {68110#true} #61#return; {68110#true} is VALID
[2022-04-08 10:11:32,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {68110#true} assume true; {68110#true} is VALID
[2022-04-08 10:11:32,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {68110#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {68110#true} is VALID
[2022-04-08 10:11:32,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {68110#true} call ULTIMATE.init(); {68110#true} is VALID
[2022-04-08 10:11:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:11:32,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425464536] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:11:32,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:11:32,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60
[2022-04-08 10:11:32,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:11:32,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213031488]
[2022-04-08 10:11:32,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213031488] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:11:32,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:11:32,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31
[2022-04-08 10:11:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497290600]
[2022-04-08 10:11:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:11:32,656 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:32,656 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:11:32,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:32,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:32,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2022-04-08 10:11:32,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:32,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2022-04-08 10:11:32,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=848, Invalid=2692, Unknown=0, NotChecked=0, Total=3540
[2022-04-08 10:11:32,678 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:38,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:38,426 INFO L93 Difference]: Finished difference Result 176 states and 242 transitions.
[2022-04-08 10:11:38,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2022-04-08 10:11:38,426 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40
[2022-04-08 10:11:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:11:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 179 transitions.
[2022-04-08 10:11:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 179 transitions.
[2022-04-08 10:11:38,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 179 transitions.
[2022-04-08 10:11:38,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:38,570 INFO L225 Difference]: With dead ends: 176
[2022-04-08 10:11:38,570 INFO L226 Difference]: Without dead ends: 170
[2022-04-08 10:11:38,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1718, Invalid=5938, Unknown=0, NotChecked=0, Total=7656
[2022-04-08 10:11:38,571 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 156 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3616 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 3727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2022-04-08 10:11:38,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 205 Invalid, 3727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3616 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2022-04-08 10:11:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2022-04-08 10:11:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 143.
[2022-04-08 10:11:38,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:11:38,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:38,728 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:38,728 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:38,729 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions.
[2022-04-08 10:11:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions.
[2022-04-08 10:11:38,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:38,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:38,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states.
[2022-04-08 10:11:38,730 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 170 states.
[2022-04-08 10:11:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:38,731 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions.
[2022-04-08 10:11:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions.
[2022-04-08 10:11:38,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:38,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:38,731 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:11:38,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:11:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions.
[2022-04-08 10:11:38,733 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 40
[2022-04-08 10:11:38,733 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:11:38,733 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions.
[2022-04-08 10:11:38,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:38,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 181 transitions.
[2022-04-08 10:11:42,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 180 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions.
[2022-04-08 10:11:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-04-08 10:11:42,101 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:11:42,101 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:11:42,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0
[2022-04-08 10:11:42,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:42,301 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:11:42,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:11:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 115 times
[2022-04-08 10:11:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:42,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [660971651]
[2022-04-08 10:11:42,306 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:11:42,306 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:11:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 116 times
[2022-04-08 10:11:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:11:42,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054201471]
[2022-04-08 10:11:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:11:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:11:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:11:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:43,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {69475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69446#true} is VALID
[2022-04-08 10:11:43,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {69446#true} assume true; {69446#true} is VALID
[2022-04-08 10:11:43,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69446#true} {69446#true} #61#return; {69446#true} is VALID
[2022-04-08 10:11:43,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {69446#true} call ULTIMATE.init(); {69475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:11:43,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {69475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69446#true} is VALID
[2022-04-08 10:11:43,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {69446#true} assume true; {69446#true} is VALID
[2022-04-08 10:11:43,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69446#true} {69446#true} #61#return; {69446#true} is VALID
[2022-04-08 10:11:43,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {69446#true} call #t~ret11 := main(); {69446#true} is VALID
[2022-04-08 10:11:43,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {69446#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69451#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:11:43,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {69451#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69452#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:43,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {69452#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69453#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:11:43,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {69453#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69454#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:43,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {69454#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69455#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:11:43,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {69455#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69456#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:43,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {69456#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69457#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID
[2022-04-08 10:11:43,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {69457#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69458#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:11:43,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {69458#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69459#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967287)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:43,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {69459#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967287)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69460#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 9 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:43,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {69460#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 9 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {69461#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:43,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {69461#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} is VALID
[2022-04-08 10:11:43,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} is VALID
[2022-04-08 10:11:43,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} is VALID
[2022-04-08 10:11:43,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:11:43,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID
[2022-04-08 10:11:43,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID
[2022-04-08 10:11:43,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:11:43,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:43,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} is VALID
[2022-04-08 10:11:43,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} is VALID
[2022-04-08 10:11:43,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:43,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:43,502 INFO L272 TraceCheckUtils]: 37: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:11:43,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {69473#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {69474#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:11:43,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {69474#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {69447#false} is VALID
[2022-04-08 10:11:43,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {69447#false} assume !false; {69447#false} is VALID
[2022-04-08 10:11:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:11:43,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:11:43,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054201471]
[2022-04-08 10:11:43,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054201471] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:11:43,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526346381]
[2022-04-08 10:11:43,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:11:43,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:43,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:11:43,504 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:11:43,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process
[2022-04-08 10:11:43,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:11:43,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:11:43,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 86 conjunts are in the unsatisfiable core
[2022-04-08 10:11:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:43,839 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:11:45,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {69446#true} call ULTIMATE.init(); {69446#true} is VALID
[2022-04-08 10:11:45,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {69446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69446#true} is VALID
[2022-04-08 10:11:45,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {69446#true} assume true; {69446#true} is VALID
[2022-04-08 10:11:45,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69446#true} {69446#true} #61#return; {69446#true} is VALID
[2022-04-08 10:11:45,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {69446#true} call #t~ret11 := main(); {69446#true} is VALID
[2022-04-08 10:11:45,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {69446#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69451#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:11:45,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {69451#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69497#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID
[2022-04-08 10:11:45,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {69497#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69501#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID
[2022-04-08 10:11:45,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {69501#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69505#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)))} is VALID
[2022-04-08 10:11:45,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {69505#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69509#(and (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (= (+ (- 2) main_~y~0) 2))} is VALID
[2022-04-08 10:11:45,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {69509#(and (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (= (+ (- 2) main_~y~0) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69513#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (= (+ main_~y~0 (- 3)) 2) (= (+ main_~n~0 (- 3)) (+ main_~x~0 2)))} is VALID
[2022-04-08 10:11:45,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {69513#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (= (+ main_~y~0 (- 3)) 2) (= (+ main_~n~0 (- 3)) (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69517#(and (= main_~y~0 6) (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} is VALID
[2022-04-08 10:11:45,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {69517#(and (= main_~y~0 6) (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69521#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (= 7 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} is VALID
[2022-04-08 10:11:45,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {69521#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (= 7 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69525#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= 7 (+ (- 1) main_~y~0)) (< 0 (mod (+ main_~n~0 4294967289) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 7))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} is VALID
[2022-04-08 10:11:45,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {69525#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= 7 (+ (- 1) main_~y~0)) (< 0 (mod (+ main_~n~0 4294967289) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 7))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69529#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= main_~y~0 9) (= (+ main_~x~0 2) (+ main_~n~0 (- 7))) (< 0 (mod (+ main_~n~0 4294967289) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} is VALID
[2022-04-08 10:11:45,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {69529#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= main_~y~0 9) (= (+ main_~x~0 2) (+ main_~n~0 (- 7))) (< 0 (mod (+ main_~n~0 4294967289) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {69461#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:45,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {69461#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} is VALID
[2022-04-08 10:11:45,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} is VALID
[2022-04-08 10:11:45,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} is VALID
[2022-04-08 10:11:45,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:11:45,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID
[2022-04-08 10:11:45,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID
[2022-04-08 10:11:45,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:11:45,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:11:45,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} is VALID
[2022-04-08 10:11:45,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} is VALID
[2022-04-08 10:11:45,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} is VALID
[2022-04-08 10:11:45,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} is VALID
[2022-04-08 10:11:45,560 INFO L272 TraceCheckUtils]: 37: Hoare triple {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69599#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:11:45,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {69599#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {69603#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:11:45,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {69603#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {69447#false} is VALID
[2022-04-08 10:11:45,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {69447#false} assume !false; {69447#false} is VALID
[2022-04-08 10:11:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:11:45,561 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:11:49,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {69447#false} assume !false; {69447#false} is VALID
[2022-04-08 10:11:49,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {69603#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {69447#false} is VALID
[2022-04-08 10:11:49,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {69599#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {69603#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:11:49,979 INFO L272 TraceCheckUtils]: 37: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69599#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:11:49,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {69625#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {69629#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69625#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {69633#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69629#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:11:49,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {69637#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69633#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {69641#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69637#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:11:49,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {69645#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69641#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {69649#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69645#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:11:49,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {69653#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69649#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {69657#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69653#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {69657#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} assume !(~z~0 % 4294967296 > 0); {69657#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} is VALID
[2022-04-08 10:11:49,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {69653#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69657#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} is VALID
[2022-04-08 10:11:49,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {69649#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69653#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {69645#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69649#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {69641#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69645#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:11:49,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {69637#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69641#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {69633#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69637#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:11:49,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {69629#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69633#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:49,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {69625#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69629#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:11:50,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69625#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:50,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {69691#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:11:50,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {69695#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {69691#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:11:50,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {69699#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69695#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:11:50,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {69703#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69699#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:11:50,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {69707#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69703#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:11:50,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {69711#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69707#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:11:50,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {69715#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69711#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:11:50,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {69719#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69715#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:11:50,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {69723#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69719#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:11:50,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {69727#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69723#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:11:50,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {69731#(or (and (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10)) (<= (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967287) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {69727#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:11:50,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {69446#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69731#(or (and (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10)) (<= (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967287) 4294967296)))} is VALID
[2022-04-08 10:11:50,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {69446#true} call #t~ret11 := main(); {69446#true} is VALID
[2022-04-08 10:11:50,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69446#true} {69446#true} #61#return; {69446#true} is VALID
[2022-04-08 10:11:50,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {69446#true} assume true; {69446#true} is VALID
[2022-04-08 10:11:50,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {69446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {69446#true} is VALID
[2022-04-08 10:11:50,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {69446#true} call ULTIMATE.init(); {69446#true} is VALID
[2022-04-08 10:11:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:11:50,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526346381] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:11:50,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:11:50,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 58
[2022-04-08 10:11:50,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:11:50,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [660971651]
[2022-04-08 10:11:50,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [660971651] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:11:50,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:11:50,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-04-08 10:11:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536348984]
[2022-04-08 10:11:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:11:50,017 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:11:50,017 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:11:50,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:50,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:50,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-04-08 10:11:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:50,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-04-08 10:11:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2988, Unknown=0, NotChecked=0, Total=3306
[2022-04-08 10:11:50,281 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:54,957 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions.
[2022-04-08 10:11:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2022-04-08 10:11:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:11:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:11:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions.
[2022-04-08 10:11:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions.
[2022-04-08 10:11:54,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 61 transitions.
[2022-04-08 10:11:55,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:55,214 INFO L225 Difference]: With dead ends: 172
[2022-04-08 10:11:55,214 INFO L226 Difference]: Without dead ends: 132
[2022-04-08 10:11:55,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=639, Invalid=7371, Unknown=0, NotChecked=0, Total=8010
[2022-04-08 10:11:55,215 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:11:55,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 134 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-04-08 10:11:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2022-04-08 10:11:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2022-04-08 10:11:55,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:11:55,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:55,367 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:55,367 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:55,368 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions.
[2022-04-08 10:11:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions.
[2022-04-08 10:11:55,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:55,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:55,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 132 states.
[2022-04-08 10:11:55,369 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 132 states.
[2022-04-08 10:11:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:11:55,370 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions.
[2022-04-08 10:11:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions.
[2022-04-08 10:11:55,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:11:55,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:11:55,370 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:11:55,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:11:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions.
[2022-04-08 10:11:55,371 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 41
[2022-04-08 10:11:55,371 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:11:55,371 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions.
[2022-04-08 10:11:55,371 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:11:55,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 168 transitions.
[2022-04-08 10:11:59,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 167 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:11:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions.
[2022-04-08 10:11:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-04-08 10:11:59,393 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:11:59,393 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:11:59,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0
[2022-04-08 10:11:59,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:59,597 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:11:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:11:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash -600496849, now seen corresponding path program 117 times
[2022-04-08 10:11:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:11:59,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1137685911]
[2022-04-08 10:11:59,599 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:11:59,599 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:11:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -600496849, now seen corresponding path program 118 times
[2022-04-08 10:11:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:11:59,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134254310]
[2022-04-08 10:11:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:11:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:11:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:11:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:59,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {70712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70688#true} is VALID
[2022-04-08 10:11:59,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {70688#true} assume true; {70688#true} is VALID
[2022-04-08 10:11:59,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70688#true} {70688#true} #61#return; {70688#true} is VALID
[2022-04-08 10:11:59,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {70688#true} call ULTIMATE.init(); {70712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:11:59,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {70712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70688#true} is VALID
[2022-04-08 10:11:59,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {70688#true} assume true; {70688#true} is VALID
[2022-04-08 10:11:59,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70688#true} {70688#true} #61#return; {70688#true} is VALID
[2022-04-08 10:11:59,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {70688#true} call #t~ret11 := main(); {70688#true} is VALID
[2022-04-08 10:11:59,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {70688#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70693#(= main_~y~0 0)} is VALID
[2022-04-08 10:11:59,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {70693#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70694#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:11:59,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {70694#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70695#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:11:59,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {70695#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70696#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:11:59,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {70696#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70697#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:11:59,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {70697#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70698#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:11:59,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {70698#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70699#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:11:59,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {70699#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70700#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:11:59,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {70700#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70701#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:11:59,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {70701#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70702#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:11:59,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {70702#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:59,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:11:59,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {70704#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:11:59,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {70704#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70705#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:11:59,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {70705#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70706#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:11:59,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {70706#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70707#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:11:59,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {70707#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70708#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:11:59,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {70708#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70709#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:11:59,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {70709#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70710#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:11:59,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {70710#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70711#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:11:59,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {70711#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {70689#false} is VALID
[2022-04-08 10:11:59,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {70689#false} assume !(~y~0 % 4294967296 > 0); {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L272 TraceCheckUtils]: 37: Hoare triple {70689#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {70689#false} ~cond := #in~cond; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {70689#false} assume 0 == ~cond; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {70689#false} assume !false; {70689#false} is VALID
[2022-04-08 10:11:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:11:59,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:11:59,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134254310]
[2022-04-08 10:11:59,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134254310] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:11:59,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137552714]
[2022-04-08 10:11:59,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:11:59,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:11:59,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:11:59,909 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:11:59,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process
[2022-04-08 10:11:59,955 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:11:59,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:11:59,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 54 conjunts are in the unsatisfiable core
[2022-04-08 10:11:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:11:59,975 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:12:00,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {70688#true} call ULTIMATE.init(); {70688#true} is VALID
[2022-04-08 10:12:00,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {70688#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70688#true} is VALID
[2022-04-08 10:12:00,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {70688#true} assume true; {70688#true} is VALID
[2022-04-08 10:12:00,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70688#true} {70688#true} #61#return; {70688#true} is VALID
[2022-04-08 10:12:00,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {70688#true} call #t~ret11 := main(); {70688#true} is VALID
[2022-04-08 10:12:00,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {70688#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70693#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:00,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {70693#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70694#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:00,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {70694#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70695#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:00,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {70695#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70696#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:00,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {70696#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70697#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:00,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {70697#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70698#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:00,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {70698#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70699#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:00,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {70699#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70700#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:00,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {70700#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70701#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:00,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {70701#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70702#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:00,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {70702#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:00,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:00,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {70767#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:00,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {70767#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70771#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:12:00,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {70771#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70775#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:00,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {70775#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70779#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID
[2022-04-08 10:12:00,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {70779#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70783#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 4)))} is VALID
[2022-04-08 10:12:00,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {70783#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70787#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:00,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {70787#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70791#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:00,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {70791#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70795#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID
[2022-04-08 10:12:00,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {70795#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {70689#false} is VALID
[2022-04-08 10:12:00,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {70689#false} assume !(~y~0 % 4294967296 > 0); {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L272 TraceCheckUtils]: 37: Hoare triple {70689#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {70689#false} ~cond := #in~cond; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {70689#false} assume 0 == ~cond; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {70689#false} assume !false; {70689#false} is VALID
[2022-04-08 10:12:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:12:00,353 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:12:00,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {70689#false} assume !false; {70689#false} is VALID
[2022-04-08 10:12:00,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {70689#false} assume 0 == ~cond; {70689#false} is VALID
[2022-04-08 10:12:00,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {70689#false} ~cond := #in~cond; {70689#false} is VALID
[2022-04-08 10:12:00,968 INFO L272 TraceCheckUtils]: 37: Hoare triple {70689#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70689#false} is VALID
[2022-04-08 10:12:00,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {70689#false} assume !(~y~0 % 4294967296 > 0); {70689#false} is VALID
[2022-04-08 10:12:00,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {70865#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID
[2022-04-08 10:12:00,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {70869#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70865#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:12:00,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {70873#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70869#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:12:00,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {70877#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70873#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:12:00,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {70881#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70877#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:12:00,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {70885#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70881#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:12:00,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {70889#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70885#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:12:00,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {70893#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70889#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:12:00,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {70897#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {70893#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:12:00,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {70901#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70897#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:12:00,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {70905#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70901#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:12:00,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {70909#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70905#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:12:00,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {70913#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70909#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:12:00,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {70917#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70913#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:12:00,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {70921#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70917#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:12:00,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {70925#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70921#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:12:00,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {70688#true} ~z~0 := ~y~0; {70925#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:12:00,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {70688#true} assume !(~x~0 % 4294967296 > 0); {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {70688#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {70688#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {70688#true} call #t~ret11 := main(); {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70688#true} {70688#true} #61#return; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {70688#true} assume true; {70688#true} is VALID
[2022-04-08 10:12:00,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {70688#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70688#true} is VALID
[2022-04-08 10:12:00,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {70688#true} call ULTIMATE.init(); {70688#true} is VALID
[2022-04-08 10:12:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2022-04-08 10:12:00,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137552714] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:12:00,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:12:00,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 18] total 46
[2022-04-08 10:12:00,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:12:00,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1137685911]
[2022-04-08 10:12:00,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1137685911] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:12:00,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:12:00,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2022-04-08 10:12:00,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856076965]
[2022-04-08 10:12:00,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:12:00,983 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:00,983 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:12:00,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:01,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:01,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2022-04-08 10:12:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2022-04-08 10:12:01,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1813, Unknown=0, NotChecked=0, Total=2070
[2022-04-08 10:12:01,005 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:02,500 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions.
[2022-04-08 10:12:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-04-08 10:12:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:12:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions.
[2022-04-08 10:12:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions.
[2022-04-08 10:12:02,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 59 transitions.
[2022-04-08 10:12:02,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:02,549 INFO L225 Difference]: With dead ends: 161
[2022-04-08 10:12:02,549 INFO L226 Difference]: Without dead ends: 145
[2022-04-08 10:12:02,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=441, Invalid=3719, Unknown=0, NotChecked=0, Total=4160
[2022-04-08 10:12:02,550 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:12:02,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:12:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2022-04-08 10:12:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133.
[2022-04-08 10:12:02,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:12:02,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:02,694 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:02,695 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:02,696 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions.
[2022-04-08 10:12:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 181 transitions.
[2022-04-08 10:12:02,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:02,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:02,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states.
[2022-04-08 10:12:02,696 INFO L87 Difference]: Start difference. First operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states.
[2022-04-08 10:12:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:02,698 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions.
[2022-04-08 10:12:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 181 transitions.
[2022-04-08 10:12:02,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:02,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:02,698 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:12:02,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:12:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions.
[2022-04-08 10:12:02,699 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 41
[2022-04-08 10:12:02,699 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:12:02,699 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions.
[2022-04-08 10:12:02,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:02,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 169 transitions.
[2022-04-08 10:12:07,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 168 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions.
[2022-04-08 10:12:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-04-08 10:12:07,642 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:12:07,642 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:12:07,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0
[2022-04-08 10:12:07,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:07,842 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:12:07,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:12:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash 870484735, now seen corresponding path program 119 times
[2022-04-08 10:12:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:07,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76312452]
[2022-04-08 10:12:07,845 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:12:07,845 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:12:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash 870484735, now seen corresponding path program 120 times
[2022-04-08 10:12:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:12:07,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130686821]
[2022-04-08 10:12:07,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:12:07,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:12:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:08,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:12:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:08,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {71921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71898#true} is VALID
[2022-04-08 10:12:08,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {71898#true} assume true; {71898#true} is VALID
[2022-04-08 10:12:08,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71898#true} {71898#true} #61#return; {71898#true} is VALID
[2022-04-08 10:12:08,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {71898#true} call ULTIMATE.init(); {71921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:12:08,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {71921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71898#true} is VALID
[2022-04-08 10:12:08,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {71898#true} assume true; {71898#true} is VALID
[2022-04-08 10:12:08,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71898#true} {71898#true} #61#return; {71898#true} is VALID
[2022-04-08 10:12:08,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {71898#true} call #t~ret11 := main(); {71898#true} is VALID
[2022-04-08 10:12:08,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {71898#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71903#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:08,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {71903#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71904#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:08,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {71904#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71905#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:08,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {71905#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71906#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:08,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {71906#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71907#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:08,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {71907#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71908#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:08,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {71908#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71909#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:08,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {71909#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71910#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:08,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {71910#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71911#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:08,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {71911#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71912#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:08,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {71912#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71913#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:08,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {71913#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:08,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:08,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {71915#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:12:08,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {71915#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71916#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:12:08,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {71916#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:12:08,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {71917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:12:08,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {71918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:12:08,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {71919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71920#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:12:08,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {71920#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71899#false} is VALID
[2022-04-08 10:12:08,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {71899#false} assume !(~y~0 % 4294967296 > 0); {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L272 TraceCheckUtils]: 37: Hoare triple {71899#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {71899#false} ~cond := #in~cond; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {71899#false} assume 0 == ~cond; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {71899#false} assume !false; {71899#false} is VALID
[2022-04-08 10:12:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:12:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:12:08,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130686821]
[2022-04-08 10:12:08,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130686821] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:12:08,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923563216]
[2022-04-08 10:12:08,141 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:12:08,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:12:08,142 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:12:08,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process
[2022-04-08 10:12:08,503 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2022-04-08 10:12:08,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:12:08,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core
[2022-04-08 10:12:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:08,515 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:12:08,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {71898#true} call ULTIMATE.init(); {71898#true} is VALID
[2022-04-08 10:12:08,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {71898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71898#true} is VALID
[2022-04-08 10:12:08,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {71898#true} assume true; {71898#true} is VALID
[2022-04-08 10:12:08,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71898#true} {71898#true} #61#return; {71898#true} is VALID
[2022-04-08 10:12:08,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {71898#true} call #t~ret11 := main(); {71898#true} is VALID
[2022-04-08 10:12:08,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {71898#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71903#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:08,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {71903#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71904#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:08,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {71904#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71905#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:08,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {71905#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71906#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:08,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {71906#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71907#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:08,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {71907#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71908#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:08,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {71908#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71909#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:08,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {71909#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71910#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:08,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {71910#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71911#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:08,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {71911#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71912#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:08,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {71912#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71913#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:08,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {71913#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:08,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:08,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {71915#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:12:08,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {71915#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71916#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:12:08,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {71916#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:12:08,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {71917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:12:08,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {71918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:12:08,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {71919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71994#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:12:08,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {71994#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71899#false} is VALID
[2022-04-08 10:12:08,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {71899#false} assume !(~y~0 % 4294967296 > 0); {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L272 TraceCheckUtils]: 37: Hoare triple {71899#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {71899#false} ~cond := #in~cond; {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {71899#false} assume 0 == ~cond; {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {71899#false} assume !false; {71899#false} is VALID
[2022-04-08 10:12:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:12:08,794 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:12:09,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {71899#false} assume !false; {71899#false} is VALID
[2022-04-08 10:12:09,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {71899#false} assume 0 == ~cond; {71899#false} is VALID
[2022-04-08 10:12:09,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {71899#false} ~cond := #in~cond; {71899#false} is VALID
[2022-04-08 10:12:09,342 INFO L272 TraceCheckUtils]: 37: Hoare triple {71899#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {71899#false} is VALID
[2022-04-08 10:12:09,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {71899#false} assume !(~y~0 % 4294967296 > 0); {71899#false} is VALID
[2022-04-08 10:12:09,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID
[2022-04-08 10:12:09,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {72094#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {71899#false} is VALID
[2022-04-08 10:12:09,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {72098#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72094#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:12:09,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {72102#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72098#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:12:09,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {72106#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72102#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:12:09,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {72110#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72106#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:12:09,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {72114#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72110#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:12:09,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {72118#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {72114#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:12:09,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {72118#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72118#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:09,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {72125#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72118#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:09,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {72129#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72125#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:09,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {72133#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72129#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:12:09,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {72137#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72133#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:12:09,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {72141#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72137#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:12:09,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {72145#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72141#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:12:09,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {72149#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72145#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:12:09,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {72153#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72149#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:12:09,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {72157#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72153#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:12:09,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {72161#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72157#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:12:09,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {72165#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72161#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:09,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {71898#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72165#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:12:09,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {71898#true} call #t~ret11 := main(); {71898#true} is VALID
[2022-04-08 10:12:09,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71898#true} {71898#true} #61#return; {71898#true} is VALID
[2022-04-08 10:12:09,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {71898#true} assume true; {71898#true} is VALID
[2022-04-08 10:12:09,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {71898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71898#true} is VALID
[2022-04-08 10:12:09,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {71898#true} call ULTIMATE.init(); {71898#true} is VALID
[2022-04-08 10:12:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:12:09,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923563216] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:12:09,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:12:09,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40
[2022-04-08 10:12:09,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:12:09,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76312452]
[2022-04-08 10:12:09,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76312452] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:12:09,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:12:09,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2022-04-08 10:12:09,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246210522]
[2022-04-08 10:12:09,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:12:09,367 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:09,367 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:12:09,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:09,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:09,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2022-04-08 10:12:09,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:09,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2022-04-08 10:12:09,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560
[2022-04-08 10:12:09,387 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:10,925 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions.
[2022-04-08 10:12:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2022-04-08 10:12:10,925 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:12:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions.
[2022-04-08 10:12:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions.
[2022-04-08 10:12:10,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 68 transitions.
[2022-04-08 10:12:10,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:10,989 INFO L225 Difference]: With dead ends: 164
[2022-04-08 10:12:10,989 INFO L226 Difference]: Without dead ends: 147
[2022-04-08 10:12:10,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=731, Invalid=3175, Unknown=0, NotChecked=0, Total=3906
[2022-04-08 10:12:10,989 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:12:10,989 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:12:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2022-04-08 10:12:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134.
[2022-04-08 10:12:11,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:12:11,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:11,150 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:11,150 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:11,152 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions.
[2022-04-08 10:12:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions.
[2022-04-08 10:12:11,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:11,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:11,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states.
[2022-04-08 10:12:11,152 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states.
[2022-04-08 10:12:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:11,153 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions.
[2022-04-08 10:12:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions.
[2022-04-08 10:12:11,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:11,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:11,154 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:12:11,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:12:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions.
[2022-04-08 10:12:11,155 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 41
[2022-04-08 10:12:11,155 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:12:11,155 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions.
[2022-04-08 10:12:11,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:11,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 170 transitions.
[2022-04-08 10:12:16,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 168 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions.
[2022-04-08 10:12:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-04-08 10:12:16,545 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:12:16,545 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:12:16,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0
[2022-04-08 10:12:16,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:16,746 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:12:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:12:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1132790639, now seen corresponding path program 121 times
[2022-04-08 10:12:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:16,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2077818610]
[2022-04-08 10:12:16,748 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:12:16,748 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:12:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1132790639, now seen corresponding path program 122 times
[2022-04-08 10:12:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:12:16,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791512198]
[2022-04-08 10:12:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:12:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:12:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:17,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:12:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:17,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {73144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73122#true} is VALID
[2022-04-08 10:12:17,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {73122#true} assume true; {73122#true} is VALID
[2022-04-08 10:12:17,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73122#true} {73122#true} #61#return; {73122#true} is VALID
[2022-04-08 10:12:17,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {73122#true} call ULTIMATE.init(); {73144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:12:17,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {73144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73122#true} is VALID
[2022-04-08 10:12:17,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {73122#true} assume true; {73122#true} is VALID
[2022-04-08 10:12:17,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73122#true} {73122#true} #61#return; {73122#true} is VALID
[2022-04-08 10:12:17,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {73122#true} call #t~ret11 := main(); {73122#true} is VALID
[2022-04-08 10:12:17,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {73122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73127#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:17,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {73127#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:17,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {73128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:17,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {73129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:17,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {73130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:17,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {73131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:17,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {73132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:17,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {73133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:17,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {73134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:17,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {73135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:17,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {73136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:17,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {73137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:17,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {73138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:12:17,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:12:17,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {73140#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:12:17,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {73140#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73141#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:12:17,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {73141#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73142#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:12:17,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {73142#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73143#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {73143#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {73123#false} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {73123#false} assume !(~y~0 % 4294967296 > 0); {73123#false} is VALID
[2022-04-08 10:12:17,019 INFO L272 TraceCheckUtils]: 37: Hoare triple {73123#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73123#false} is VALID
[2022-04-08 10:12:17,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {73123#false} ~cond := #in~cond; {73123#false} is VALID
[2022-04-08 10:12:17,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {73123#false} assume 0 == ~cond; {73123#false} is VALID
[2022-04-08 10:12:17,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {73123#false} assume !false; {73123#false} is VALID
[2022-04-08 10:12:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:12:17,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:12:17,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791512198]
[2022-04-08 10:12:17,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791512198] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:12:17,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493282812]
[2022-04-08 10:12:17,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:12:17,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:17,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:12:17,020 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:12:17,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process
[2022-04-08 10:12:17,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:12:17,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:12:17,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 35 conjunts are in the unsatisfiable core
[2022-04-08 10:12:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:17,075 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:12:17,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {73122#true} call ULTIMATE.init(); {73122#true} is VALID
[2022-04-08 10:12:17,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {73122#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73122#true} is VALID
[2022-04-08 10:12:17,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {73122#true} assume true; {73122#true} is VALID
[2022-04-08 10:12:17,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73122#true} {73122#true} #61#return; {73122#true} is VALID
[2022-04-08 10:12:17,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {73122#true} call #t~ret11 := main(); {73122#true} is VALID
[2022-04-08 10:12:17,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {73122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73127#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:17,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {73127#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:17,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {73128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:17,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {73129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:17,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {73130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:17,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {73131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:17,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {73132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:17,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {73133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:17,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {73134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:17,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {73135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:17,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {73136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:17,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {73137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:17,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {73138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:12:17,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:12:17,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {73140#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:12:17,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {73140#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73141#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:12:17,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {73141#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73142#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:12:17,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {73142#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:12:17,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {73214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {73123#false} is VALID
[2022-04-08 10:12:17,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {73123#false} assume !(~y~0 % 4294967296 > 0); {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L272 TraceCheckUtils]: 37: Hoare triple {73123#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {73123#false} ~cond := #in~cond; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {73123#false} assume 0 == ~cond; {73123#false} is VALID
[2022-04-08 10:12:17,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {73123#false} assume !false; {73123#false} is VALID
[2022-04-08 10:12:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:12:17,354 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {73123#false} assume !false; {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {73123#false} assume 0 == ~cond; {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {73123#false} ~cond := #in~cond; {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L272 TraceCheckUtils]: 37: Hoare triple {73123#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {73123#false} assume !(~y~0 % 4294967296 > 0); {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID
[2022-04-08 10:12:17,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {73320#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73123#false} is VALID
[2022-04-08 10:12:17,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {73324#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73320#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:12:17,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {73328#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73324#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:12:17,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {73332#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73328#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:12:17,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {73336#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {73332#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:12:17,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {73336#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {73336#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:12:17,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {73343#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73336#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:12:17,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {73347#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73343#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:12:17,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {73351#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73347#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:12:17,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {73355#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73351#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:12:17,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {73359#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73355#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:12:17,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {73363#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73359#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:12:17,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {73367#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73363#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:12:17,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {73371#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73367#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:12:17,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {73375#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73371#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:17,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {73379#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73375#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:12:17,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {73383#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73379#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:17,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {73387#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73383#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:12:17,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {73122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73387#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:12:17,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {73122#true} call #t~ret11 := main(); {73122#true} is VALID
[2022-04-08 10:12:17,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73122#true} {73122#true} #61#return; {73122#true} is VALID
[2022-04-08 10:12:17,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {73122#true} assume true; {73122#true} is VALID
[2022-04-08 10:12:17,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {73122#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73122#true} is VALID
[2022-04-08 10:12:17,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {73122#true} call ULTIMATE.init(); {73122#true} is VALID
[2022-04-08 10:12:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:12:17,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493282812] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:12:17,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:12:17,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38
[2022-04-08 10:12:17,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:12:17,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2077818610]
[2022-04-08 10:12:17,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2077818610] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:12:17,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:12:17,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-04-08 10:12:17,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63227550]
[2022-04-08 10:12:17,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:12:17,881 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:17,881 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:12:17,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:17,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:17,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-04-08 10:12:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-04-08 10:12:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406
[2022-04-08 10:12:17,904 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:19,593 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions.
[2022-04-08 10:12:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2022-04-08 10:12:19,593 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:12:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions.
[2022-04-08 10:12:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions.
[2022-04-08 10:12:19,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 72 transitions.
[2022-04-08 10:12:19,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:19,657 INFO L225 Difference]: With dead ends: 167
[2022-04-08 10:12:19,657 INFO L226 Difference]: Without dead ends: 149
[2022-04-08 10:12:19,657 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=698, Invalid=2842, Unknown=0, NotChecked=0, Total=3540
[2022-04-08 10:12:19,657 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:12:19,657 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 102 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:12:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2022-04-08 10:12:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135.
[2022-04-08 10:12:19,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:12:19,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:19,841 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:19,841 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:19,842 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions.
[2022-04-08 10:12:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions.
[2022-04-08 10:12:19,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:19,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:19,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states.
[2022-04-08 10:12:19,843 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states.
[2022-04-08 10:12:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:19,844 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions.
[2022-04-08 10:12:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions.
[2022-04-08 10:12:19,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:19,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:19,844 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:12:19,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:12:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions.
[2022-04-08 10:12:19,846 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 41
[2022-04-08 10:12:19,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:12:19,846 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 171 transitions.
[2022-04-08 10:12:19,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:19,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 171 transitions.
[2022-04-08 10:12:22,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions.
[2022-04-08 10:12:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-04-08 10:12:22,191 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:12:22,191 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:12:22,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0
[2022-04-08 10:12:22,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:22,392 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:12:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:12:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1619465025, now seen corresponding path program 123 times
[2022-04-08 10:12:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:22,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1171496661]
[2022-04-08 10:12:22,394 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:12:22,394 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:12:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1619465025, now seen corresponding path program 124 times
[2022-04-08 10:12:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:12:22,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300253778]
[2022-04-08 10:12:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:12:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:12:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:12:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:22,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {74375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {74354#true} is VALID
[2022-04-08 10:12:22,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {74354#true} assume true; {74354#true} is VALID
[2022-04-08 10:12:22,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74354#true} {74354#true} #61#return; {74354#true} is VALID
[2022-04-08 10:12:22,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {74354#true} call ULTIMATE.init(); {74375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:12:22,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {74375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {74354#true} is VALID
[2022-04-08 10:12:22,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {74354#true} assume true; {74354#true} is VALID
[2022-04-08 10:12:22,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74354#true} {74354#true} #61#return; {74354#true} is VALID
[2022-04-08 10:12:22,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {74354#true} call #t~ret11 := main(); {74354#true} is VALID
[2022-04-08 10:12:22,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {74354#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74359#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:22,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {74359#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:22,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {74360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:22,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {74361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:22,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {74362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:22,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {74363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:22,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {74364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:22,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {74365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:22,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {74366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:22,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {74367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:22,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {74368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:22,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {74369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:22,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {74370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:12:22,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {74371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:12:22,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:12:22,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {74373#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID
[2022-04-08 10:12:22,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {74373#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74374#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {74374#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {74355#false} assume !(~y~0 % 4294967296 > 0); {74355#false} is VALID
[2022-04-08 10:12:22,636 INFO L272 TraceCheckUtils]: 37: Hoare triple {74355#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {74355#false} is VALID
[2022-04-08 10:12:22,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {74355#false} ~cond := #in~cond; {74355#false} is VALID
[2022-04-08 10:12:22,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {74355#false} assume 0 == ~cond; {74355#false} is VALID
[2022-04-08 10:12:22,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {74355#false} assume !false; {74355#false} is VALID
[2022-04-08 10:12:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2022-04-08 10:12:22,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:12:22,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300253778]
[2022-04-08 10:12:22,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300253778] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:12:22,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579985383]
[2022-04-08 10:12:22,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:12:22,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:22,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:12:22,639 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:12:22,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process
[2022-04-08 10:12:22,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:12:22,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:12:22,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 33 conjunts are in the unsatisfiable core
[2022-04-08 10:12:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:22,692 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:12:22,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {74354#true} call ULTIMATE.init(); {74354#true} is VALID
[2022-04-08 10:12:22,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {74354#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {74354#true} is VALID
[2022-04-08 10:12:22,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {74354#true} assume true; {74354#true} is VALID
[2022-04-08 10:12:22,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74354#true} {74354#true} #61#return; {74354#true} is VALID
[2022-04-08 10:12:22,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {74354#true} call #t~ret11 := main(); {74354#true} is VALID
[2022-04-08 10:12:22,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {74354#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74359#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:22,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {74359#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:22,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {74360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:22,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {74361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:22,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {74362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:22,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {74363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:22,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {74364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:22,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {74365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:22,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {74366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:22,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {74367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:22,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {74368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:22,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {74369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:22,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {74370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:12:22,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {74371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:12:22,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:12:22,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {74373#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID
[2022-04-08 10:12:22,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {74373#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74442#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:12:22,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {74442#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {74355#false} is VALID
[2022-04-08 10:12:22,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {74355#false} assume !(~y~0 % 4294967296 > 0); {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L272 TraceCheckUtils]: 37: Hoare triple {74355#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {74355#false} is VALID
[2022-04-08 10:12:22,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {74355#false} ~cond := #in~cond; {74355#false} is VALID
[2022-04-08 10:12:22,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {74355#false} assume 0 == ~cond; {74355#false} is VALID
[2022-04-08 10:12:22,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {74355#false} assume !false; {74355#false} is VALID
[2022-04-08 10:12:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2022-04-08 10:12:22,963 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:12:23,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {74355#false} assume !false; {74355#false} is VALID
[2022-04-08 10:12:23,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {74355#false} assume 0 == ~cond; {74355#false} is VALID
[2022-04-08 10:12:23,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {74355#false} ~cond := #in~cond; {74355#false} is VALID
[2022-04-08 10:12:23,445 INFO L272 TraceCheckUtils]: 37: Hoare triple {74355#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {74355#false} is VALID
[2022-04-08 10:12:23,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {74355#false} assume !(~y~0 % 4294967296 > 0); {74355#false} is VALID
[2022-04-08 10:12:23,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID
[2022-04-08 10:12:23,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {74554#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {74355#false} is VALID
[2022-04-08 10:12:23,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {74558#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74554#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:12:23,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {74562#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {74558#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:12:23,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {74562#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {74562#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:12:23,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {74569#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74562#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:12:23,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {74573#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74569#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:12:23,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {74577#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74573#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:12:23,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {74581#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74577#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:12:23,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {74585#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74581#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:12:23,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {74589#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74585#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:12:23,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {74593#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74589#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:23,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {74597#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74593#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:12:23,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {74601#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74597#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:23,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {74605#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74601#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:12:23,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {74609#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74605#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:12:23,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {74613#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74609#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:12:23,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {74617#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {74613#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:12:23,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {74354#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74617#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:12:23,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {74354#true} call #t~ret11 := main(); {74354#true} is VALID
[2022-04-08 10:12:23,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74354#true} {74354#true} #61#return; {74354#true} is VALID
[2022-04-08 10:12:23,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {74354#true} assume true; {74354#true} is VALID
[2022-04-08 10:12:23,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {74354#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {74354#true} is VALID
[2022-04-08 10:12:23,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {74354#true} call ULTIMATE.init(); {74354#true} is VALID
[2022-04-08 10:12:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2022-04-08 10:12:23,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579985383] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:12:23,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:12:23,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36
[2022-04-08 10:12:23,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:12:23,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1171496661]
[2022-04-08 10:12:23,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1171496661] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:12:23,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:12:23,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2022-04-08 10:12:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283178199]
[2022-04-08 10:12:23,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:12:23,460 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:23,460 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:12:23,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:23,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:23,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-08 10:12:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-08 10:12:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260
[2022-04-08 10:12:23,486 INFO L87 Difference]: Start difference. First operand 135 states and 171 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:25,087 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions.
[2022-04-08 10:12:25,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-04-08 10:12:25,087 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:12:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions.
[2022-04-08 10:12:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions.
[2022-04-08 10:12:25,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 72 transitions.
[2022-04-08 10:12:25,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:25,148 INFO L225 Difference]: With dead ends: 170
[2022-04-08 10:12:25,148 INFO L226 Difference]: Without dead ends: 151
[2022-04-08 10:12:25,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756
[2022-04-08 10:12:25,148 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:12:25,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 104 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:12:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2022-04-08 10:12:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 136.
[2022-04-08 10:12:25,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:12:25,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:25,300 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:25,301 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:25,302 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions.
[2022-04-08 10:12:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 187 transitions.
[2022-04-08 10:12:25,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:25,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:25,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states.
[2022-04-08 10:12:25,302 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states.
[2022-04-08 10:12:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:25,304 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions.
[2022-04-08 10:12:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 187 transitions.
[2022-04-08 10:12:25,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:25,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:25,304 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:12:25,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:12:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions.
[2022-04-08 10:12:25,305 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 41
[2022-04-08 10:12:25,305 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:12:25,305 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions.
[2022-04-08 10:12:25,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:25,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 172 transitions.
[2022-04-08 10:12:28,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 171 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions.
[2022-04-08 10:12:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-04-08 10:12:28,816 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:12:28,816 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:12:28,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0
[2022-04-08 10:12:29,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88
[2022-04-08 10:12:29,023 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:12:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:12:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2026195186, now seen corresponding path program 53 times
[2022-04-08 10:12:29,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:29,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [917981800]
[2022-04-08 10:12:29,026 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:12:29,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:12:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2026195186, now seen corresponding path program 54 times
[2022-04-08 10:12:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:12:29,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672064088]
[2022-04-08 10:12:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:12:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:12:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:12:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:29,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {75620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75586#true} is VALID
[2022-04-08 10:12:29,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {75586#true} assume true; {75586#true} is VALID
[2022-04-08 10:12:29,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75586#true} {75586#true} #61#return; {75586#true} is VALID
[2022-04-08 10:12:29,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {75586#true} call ULTIMATE.init(); {75620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:12:29,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {75620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75586#true} is VALID
[2022-04-08 10:12:29,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {75586#true} assume true; {75586#true} is VALID
[2022-04-08 10:12:29,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75586#true} {75586#true} #61#return; {75586#true} is VALID
[2022-04-08 10:12:29,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {75586#true} call #t~ret11 := main(); {75586#true} is VALID
[2022-04-08 10:12:29,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {75586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75591#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:29,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {75591#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:29,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {75592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:29,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {75593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:29,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {75594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:29,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {75595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:29,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {75596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75597#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:29,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {75597#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75598#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:29,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {75598#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75599#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:29,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {75599#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75600#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:29,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {75600#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75601#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:29,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {75601#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75602#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:29,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {75602#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75603#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:12:29,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {75603#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75604#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:12:29,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {75604#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75605#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:12:29,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {75605#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75606#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:12:29,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {75606#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75607#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:12:29,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {75607#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75608#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:12:29,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {75608#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75609#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:12:29,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {75609#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75610#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:12:29,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {75610#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75611#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:12:29,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {75611#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75612#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:12:29,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {75612#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75613#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:12:29,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {75613#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75614#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:12:29,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {75614#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75615#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:12:29,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {75615#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75616#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:12:29,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {75616#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75617#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:12:29,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {75617#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID
[2022-04-08 10:12:29,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID
[2022-04-08 10:12:29,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {75619#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} is VALID
[2022-04-08 10:12:29,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {75619#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75587#false} is VALID
[2022-04-08 10:12:29,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {75587#false} assume !(~y~0 % 4294967296 > 0); {75587#false} is VALID
[2022-04-08 10:12:29,588 INFO L272 TraceCheckUtils]: 37: Hoare triple {75587#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75587#false} is VALID
[2022-04-08 10:12:29,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {75587#false} ~cond := #in~cond; {75587#false} is VALID
[2022-04-08 10:12:29,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {75587#false} assume 0 == ~cond; {75587#false} is VALID
[2022-04-08 10:12:29,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {75587#false} assume !false; {75587#false} is VALID
[2022-04-08 10:12:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:12:29,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:12:29,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672064088]
[2022-04-08 10:12:29,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672064088] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:12:29,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258728864]
[2022-04-08 10:12:29,589 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:12:29,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:29,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:12:29,590 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:12:29,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process
[2022-04-08 10:12:30,913 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s)
[2022-04-08 10:12:30,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:12:30,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 59 conjunts are in the unsatisfiable core
[2022-04-08 10:12:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:30,927 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:12:31,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {75586#true} call ULTIMATE.init(); {75586#true} is VALID
[2022-04-08 10:12:31,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {75586#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75586#true} is VALID
[2022-04-08 10:12:31,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {75586#true} assume true; {75586#true} is VALID
[2022-04-08 10:12:31,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75586#true} {75586#true} #61#return; {75586#true} is VALID
[2022-04-08 10:12:31,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {75586#true} call #t~ret11 := main(); {75586#true} is VALID
[2022-04-08 10:12:31,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {75586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75591#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:31,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {75591#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:31,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {75592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:31,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {75593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:31,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {75594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:31,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {75595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:31,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {75596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75597#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:31,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {75597#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75598#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:31,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {75598#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75599#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:31,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {75599#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75600#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:31,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {75600#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75601#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:31,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {75601#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75602#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:31,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {75602#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75603#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:12:31,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {75603#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75604#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:12:31,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {75604#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75605#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:12:31,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {75605#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75606#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:12:31,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {75606#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75607#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:12:31,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {75607#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75608#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:12:31,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {75608#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75609#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:12:31,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {75609#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75610#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:12:31,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {75610#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75611#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:12:31,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {75611#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75612#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:12:31,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {75612#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75613#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:12:31,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {75613#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75614#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:12:31,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {75614#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75615#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:12:31,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {75615#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75616#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:12:31,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {75616#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75617#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:12:31,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {75617#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID
[2022-04-08 10:12:31,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID
[2022-04-08 10:12:31,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {75726#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID
[2022-04-08 10:12:31,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {75726#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75587#false} is VALID
[2022-04-08 10:12:31,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {75587#false} assume !(~y~0 % 4294967296 > 0); {75587#false} is VALID
[2022-04-08 10:12:31,307 INFO L272 TraceCheckUtils]: 37: Hoare triple {75587#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75587#false} is VALID
[2022-04-08 10:12:31,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {75587#false} ~cond := #in~cond; {75587#false} is VALID
[2022-04-08 10:12:31,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {75587#false} assume 0 == ~cond; {75587#false} is VALID
[2022-04-08 10:12:31,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {75587#false} assume !false; {75587#false} is VALID
[2022-04-08 10:12:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:12:31,307 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:12:32,623 INFO L290 TraceCheckUtils]: 40: Hoare triple {75587#false} assume !false; {75587#false} is VALID
[2022-04-08 10:12:32,623 INFO L290 TraceCheckUtils]: 39: Hoare triple {75587#false} assume 0 == ~cond; {75587#false} is VALID
[2022-04-08 10:12:32,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {75587#false} ~cond := #in~cond; {75587#false} is VALID
[2022-04-08 10:12:32,623 INFO L272 TraceCheckUtils]: 37: Hoare triple {75587#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75587#false} is VALID
[2022-04-08 10:12:32,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {75587#false} assume !(~y~0 % 4294967296 > 0); {75587#false} is VALID
[2022-04-08 10:12:32,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {75760#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {75587#false} is VALID
[2022-04-08 10:12:32,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {75764#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {75760#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:12:32,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {75764#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {75764#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:12:32,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {75771#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75764#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:12:32,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {75775#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75771#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:12:32,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {75779#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75775#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:12:32,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {75783#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75779#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:12:32,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {75787#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75783#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:12:32,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {75791#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75787#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:32,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {75795#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75791#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:12:32,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {75799#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75795#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:32,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {75803#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75799#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:12:32,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {75807#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75803#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:12:32,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {75811#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75807#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:12:32,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {75815#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75811#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:12:32,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {75819#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75815#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:12:32,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {75823#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75819#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:12:32,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {75827#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75823#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:12:32,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {75831#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75827#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:12:32,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {75835#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75831#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:12:32,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {75839#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75835#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:12:32,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {75843#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75839#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:12:32,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {75847#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75843#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:32,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {75851#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75847#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:12:32,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {75855#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75851#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID
[2022-04-08 10:12:32,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {75859#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75855#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID
[2022-04-08 10:12:32,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {75863#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75859#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:32,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {75867#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75863#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID
[2022-04-08 10:12:32,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {75871#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75867#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID
[2022-04-08 10:12:32,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {75875#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75871#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID
[2022-04-08 10:12:32,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {75586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75875#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID
[2022-04-08 10:12:32,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {75586#true} call #t~ret11 := main(); {75586#true} is VALID
[2022-04-08 10:12:32,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75586#true} {75586#true} #61#return; {75586#true} is VALID
[2022-04-08 10:12:32,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {75586#true} assume true; {75586#true} is VALID
[2022-04-08 10:12:32,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {75586#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75586#true} is VALID
[2022-04-08 10:12:32,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {75586#true} call ULTIMATE.init(); {75586#true} is VALID
[2022-04-08 10:12:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:12:32,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258728864] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:12:32,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:12:32,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62
[2022-04-08 10:12:32,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:12:32,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [917981800]
[2022-04-08 10:12:32,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [917981800] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:12:32,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:12:32,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32
[2022-04-08 10:12:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613553758]
[2022-04-08 10:12:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:12:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:32,644 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:12:32,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:32,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:32,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2022-04-08 10:12:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2022-04-08 10:12:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=2875, Unknown=0, NotChecked=0, Total=3782
[2022-04-08 10:12:32,669 INFO L87 Difference]: Start difference. First operand 136 states and 172 transitions. Second operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:38,780 INFO L93 Difference]: Finished difference Result 175 states and 242 transitions.
[2022-04-08 10:12:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2022-04-08 10:12:38,780 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41
[2022-04-08 10:12:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:12:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 182 transitions.
[2022-04-08 10:12:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 182 transitions.
[2022-04-08 10:12:38,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 182 transitions.
[2022-04-08 10:12:38,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:38,940 INFO L225 Difference]: With dead ends: 175
[2022-04-08 10:12:38,940 INFO L226 Difference]: Without dead ends: 169
[2022-04-08 10:12:38,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1837, Invalid=6353, Unknown=0, NotChecked=0, Total=8190
[2022-04-08 10:12:38,940 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 156 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3805 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 3920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2022-04-08 10:12:38,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 210 Invalid, 3920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3805 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2022-04-08 10:12:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2022-04-08 10:12:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141.
[2022-04-08 10:12:39,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:12:39,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:39,095 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:39,095 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:39,097 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions.
[2022-04-08 10:12:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions.
[2022-04-08 10:12:39,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:39,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:39,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states.
[2022-04-08 10:12:39,097 INFO L87 Difference]: Start difference. First operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states.
[2022-04-08 10:12:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:39,099 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions.
[2022-04-08 10:12:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions.
[2022-04-08 10:12:39,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:39,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:39,099 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:12:39,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:12:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 179 transitions.
[2022-04-08 10:12:39,101 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 179 transitions. Word has length 41
[2022-04-08 10:12:39,101 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:12:39,101 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 179 transitions.
[2022-04-08 10:12:39,101 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:39,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 179 transitions.
[2022-04-08 10:12:42,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 179 transitions.
[2022-04-08 10:12:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2022-04-08 10:12:42,882 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:12:42,882 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:12:42,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0
[2022-04-08 10:12:43,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89
[2022-04-08 10:12:43,082 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:12:43,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:12:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash -647408947, now seen corresponding path program 125 times
[2022-04-08 10:12:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:43,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881554167]
[2022-04-08 10:12:43,085 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:12:43,085 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:12:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash -647408947, now seen corresponding path program 126 times
[2022-04-08 10:12:43,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:12:43,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267528867]
[2022-04-08 10:12:43,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:12:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:12:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:12:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:43,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {76949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76924#true} is VALID
[2022-04-08 10:12:43,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {76924#true} assume true; {76924#true} is VALID
[2022-04-08 10:12:43,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76924#true} {76924#true} #61#return; {76924#true} is VALID
[2022-04-08 10:12:43,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {76924#true} call ULTIMATE.init(); {76949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:12:43,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {76949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76924#true} is VALID
[2022-04-08 10:12:43,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {76924#true} assume true; {76924#true} is VALID
[2022-04-08 10:12:43,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76924#true} {76924#true} #61#return; {76924#true} is VALID
[2022-04-08 10:12:43,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {76924#true} call #t~ret11 := main(); {76924#true} is VALID
[2022-04-08 10:12:43,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {76924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76929#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:43,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {76929#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76930#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:43,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {76930#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:43,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {76931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76932#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:43,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {76932#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76933#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:43,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {76933#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76934#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:43,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {76934#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76935#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:43,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {76935#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76936#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:43,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {76936#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76937#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:43,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {76937#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76938#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:43,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {76938#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:43,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:43,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {76940#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:12:43,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {76940#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76941#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:12:43,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {76941#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76942#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:12:43,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {76942#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76943#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:12:43,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {76943#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76944#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:12:43,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {76944#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76945#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:12:43,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {76945#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76946#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:12:43,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {76946#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76947#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:12:43,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {76947#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76948#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:12:43,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {76948#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {76925#false} is VALID
[2022-04-08 10:12:43,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:43,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {76925#false} assume !(~y~0 % 4294967296 > 0); {76925#false} is VALID
[2022-04-08 10:12:43,412 INFO L272 TraceCheckUtils]: 38: Hoare triple {76925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76925#false} is VALID
[2022-04-08 10:12:43,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {76925#false} ~cond := #in~cond; {76925#false} is VALID
[2022-04-08 10:12:43,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {76925#false} assume 0 == ~cond; {76925#false} is VALID
[2022-04-08 10:12:43,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {76925#false} assume !false; {76925#false} is VALID
[2022-04-08 10:12:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:12:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:12:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267528867]
[2022-04-08 10:12:43,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267528867] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:12:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046693802]
[2022-04-08 10:12:43,412 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:12:43,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:43,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:12:43,413 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:12:43,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process
[2022-04-08 10:12:43,620 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s)
[2022-04-08 10:12:43,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:12:43,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 58 conjunts are in the unsatisfiable core
[2022-04-08 10:12:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:43,658 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:12:44,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {76924#true} call ULTIMATE.init(); {76924#true} is VALID
[2022-04-08 10:12:44,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {76924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76924#true} is VALID
[2022-04-08 10:12:44,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {76924#true} assume true; {76924#true} is VALID
[2022-04-08 10:12:44,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76924#true} {76924#true} #61#return; {76924#true} is VALID
[2022-04-08 10:12:44,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {76924#true} call #t~ret11 := main(); {76924#true} is VALID
[2022-04-08 10:12:44,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {76924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76929#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:44,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {76929#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76930#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:44,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {76930#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:44,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {76931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76932#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:44,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {76932#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76933#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:44,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {76933#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76934#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:44,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {76934#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76935#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:44,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {76935#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76936#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:44,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {76936#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76937#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:44,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {76937#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76938#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:44,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {76938#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:44,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:44,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {77004#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:44,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {77004#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77008#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:12:44,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {77008#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77012#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:44,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {77012#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77016#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID
[2022-04-08 10:12:44,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {77016#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77020#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:44,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {77020#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77024#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID
[2022-04-08 10:12:44,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {77024#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77028#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} is VALID
[2022-04-08 10:12:44,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {77028#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77032#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID
[2022-04-08 10:12:44,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {77032#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77036#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} is VALID
[2022-04-08 10:12:44,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {77036#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {76925#false} is VALID
[2022-04-08 10:12:44,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {76925#false} assume !(~y~0 % 4294967296 > 0); {76925#false} is VALID
[2022-04-08 10:12:44,133 INFO L272 TraceCheckUtils]: 38: Hoare triple {76925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76925#false} is VALID
[2022-04-08 10:12:44,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {76925#false} ~cond := #in~cond; {76925#false} is VALID
[2022-04-08 10:12:44,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {76925#false} assume 0 == ~cond; {76925#false} is VALID
[2022-04-08 10:12:44,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {76925#false} assume !false; {76925#false} is VALID
[2022-04-08 10:12:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:12:44,133 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:12:44,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {76925#false} assume !false; {76925#false} is VALID
[2022-04-08 10:12:44,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {76925#false} assume 0 == ~cond; {76925#false} is VALID
[2022-04-08 10:12:44,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {76925#false} ~cond := #in~cond; {76925#false} is VALID
[2022-04-08 10:12:44,840 INFO L272 TraceCheckUtils]: 38: Hoare triple {76925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76925#false} is VALID
[2022-04-08 10:12:44,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {76925#false} assume !(~y~0 % 4294967296 > 0); {76925#false} is VALID
[2022-04-08 10:12:44,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {77103#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID
[2022-04-08 10:12:44,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {77107#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77103#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:12:44,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {77111#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77107#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:12:44,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {77115#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77111#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:12:44,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {77119#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77115#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:12:44,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {77123#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77119#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:12:44,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {77127#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77123#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:12:44,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {77131#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77127#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:12:44,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {77135#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77131#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:12:44,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {77139#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {77135#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:12:44,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {77143#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77139#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:12:44,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {77147#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77143#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:12:44,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {77151#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77147#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:12:44,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {77155#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77151#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:12:44,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {77159#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77155#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:12:44,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {77163#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77159#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:12:44,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {77167#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77163#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:12:44,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {77171#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77167#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {76924#true} ~z~0 := ~y~0; {77171#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {76924#true} assume !(~x~0 % 4294967296 > 0); {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {76924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76924#true} is VALID
[2022-04-08 10:12:44,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {76924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76924#true} is VALID
[2022-04-08 10:12:44,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {76924#true} call #t~ret11 := main(); {76924#true} is VALID
[2022-04-08 10:12:44,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76924#true} {76924#true} #61#return; {76924#true} is VALID
[2022-04-08 10:12:44,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {76924#true} assume true; {76924#true} is VALID
[2022-04-08 10:12:44,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {76924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76924#true} is VALID
[2022-04-08 10:12:44,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {76924#true} call ULTIMATE.init(); {76924#true} is VALID
[2022-04-08 10:12:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2022-04-08 10:12:44,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046693802] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:12:44,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:12:44,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 20] total 50
[2022-04-08 10:12:44,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:12:44,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881554167]
[2022-04-08 10:12:44,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881554167] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:12:44,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:12:44,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-04-08 10:12:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850664568]
[2022-04-08 10:12:44,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:12:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:12:44,857 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:12:44,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:44,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:44,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-04-08 10:12:44,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:44,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-04-08 10:12:44,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2150, Unknown=0, NotChecked=0, Total=2450
[2022-04-08 10:12:44,879 INFO L87 Difference]: Start difference. First operand 141 states and 179 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:46,364 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions.
[2022-04-08 10:12:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2022-04-08 10:12:46,364 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:12:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:12:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions.
[2022-04-08 10:12:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions.
[2022-04-08 10:12:46,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions.
[2022-04-08 10:12:46,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:46,412 INFO L225 Difference]: With dead ends: 170
[2022-04-08 10:12:46,412 INFO L226 Difference]: Without dead ends: 154
[2022-04-08 10:12:46,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=508, Invalid=4322, Unknown=0, NotChecked=0, Total=4830
[2022-04-08 10:12:46,413 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:12:46,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:12:46,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2022-04-08 10:12:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142.
[2022-04-08 10:12:46,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:12:46,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:46,567 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:46,567 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:46,568 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions.
[2022-04-08 10:12:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 192 transitions.
[2022-04-08 10:12:46,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:46,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:46,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 154 states.
[2022-04-08 10:12:46,569 INFO L87 Difference]: Start difference. First operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 154 states.
[2022-04-08 10:12:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:46,570 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions.
[2022-04-08 10:12:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 192 transitions.
[2022-04-08 10:12:46,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:46,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:46,570 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:12:46,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:12:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 180 transitions.
[2022-04-08 10:12:46,572 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 180 transitions. Word has length 42
[2022-04-08 10:12:46,572 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:12:46,572 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 180 transitions.
[2022-04-08 10:12:46,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:46,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 180 transitions.
[2022-04-08 10:12:51,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 180 transitions.
[2022-04-08 10:12:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2022-04-08 10:12:51,683 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:12:51,683 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:12:51,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0
[2022-04-08 10:12:51,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:51,883 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:12:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:12:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1157583489, now seen corresponding path program 127 times
[2022-04-08 10:12:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:51,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [163253500]
[2022-04-08 10:12:51,885 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:12:51,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:12:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1157583489, now seen corresponding path program 128 times
[2022-04-08 10:12:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:12:51,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206764626]
[2022-04-08 10:12:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:12:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:12:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:12:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:52,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {78224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78200#true} is VALID
[2022-04-08 10:12:52,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {78200#true} assume true; {78200#true} is VALID
[2022-04-08 10:12:52,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78200#true} {78200#true} #61#return; {78200#true} is VALID
[2022-04-08 10:12:52,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {78200#true} call ULTIMATE.init(); {78224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:12:52,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {78224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78200#true} is VALID
[2022-04-08 10:12:52,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {78200#true} assume true; {78200#true} is VALID
[2022-04-08 10:12:52,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78200#true} {78200#true} #61#return; {78200#true} is VALID
[2022-04-08 10:12:52,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {78200#true} call #t~ret11 := main(); {78200#true} is VALID
[2022-04-08 10:12:52,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {78200#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78205#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:52,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {78205#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78206#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:52,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {78206#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78207#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:52,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {78207#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78208#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:52,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {78208#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78209#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:52,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {78209#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78210#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:52,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {78210#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78211#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:52,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {78211#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78212#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:52,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {78212#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78213#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:52,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {78213#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78214#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:52,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {78214#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78215#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:52,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {78215#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:52,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:52,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {78217#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:12:52,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {78217#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:12:52,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {78218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78219#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:12:52,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {78219#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78220#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:12:52,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {78220#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78221#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:12:52,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {78221#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:12:52,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {78222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78223#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {78223#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {78201#false} assume !(~y~0 % 4294967296 > 0); {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L272 TraceCheckUtils]: 38: Hoare triple {78201#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78201#false} is VALID
[2022-04-08 10:12:52,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {78201#false} ~cond := #in~cond; {78201#false} is VALID
[2022-04-08 10:12:52,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {78201#false} assume 0 == ~cond; {78201#false} is VALID
[2022-04-08 10:12:52,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {78201#false} assume !false; {78201#false} is VALID
[2022-04-08 10:12:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:12:52,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:12:52,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206764626]
[2022-04-08 10:12:52,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206764626] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:12:52,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157047200]
[2022-04-08 10:12:52,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:12:52,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:12:52,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:12:52,198 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:12:52,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process
[2022-04-08 10:12:52,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:12:52,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:12:52,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core
[2022-04-08 10:12:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:12:52,254 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:12:52,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {78200#true} call ULTIMATE.init(); {78200#true} is VALID
[2022-04-08 10:12:52,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {78200#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78200#true} is VALID
[2022-04-08 10:12:52,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {78200#true} assume true; {78200#true} is VALID
[2022-04-08 10:12:52,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78200#true} {78200#true} #61#return; {78200#true} is VALID
[2022-04-08 10:12:52,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {78200#true} call #t~ret11 := main(); {78200#true} is VALID
[2022-04-08 10:12:52,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {78200#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78205#(= main_~y~0 0)} is VALID
[2022-04-08 10:12:52,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {78205#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78206#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:12:52,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {78206#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78207#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:12:52,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {78207#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78208#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:12:52,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {78208#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78209#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:12:52,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {78209#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78210#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:12:52,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {78210#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78211#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:12:52,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {78211#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78212#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:12:52,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {78212#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78213#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:12:52,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {78213#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78214#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:12:52,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {78214#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78215#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:12:52,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {78215#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:52,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:12:52,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {78217#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:12:52,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {78217#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:12:52,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {78218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78219#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:12:52,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {78219#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78220#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:12:52,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {78220#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78221#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:12:52,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {78221#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:12:52,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {78222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78300#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:12:52,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {78300#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78201#false} is VALID
[2022-04-08 10:12:52,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {78201#false} assume !(~y~0 % 4294967296 > 0); {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L272 TraceCheckUtils]: 38: Hoare triple {78201#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {78201#false} ~cond := #in~cond; {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {78201#false} assume 0 == ~cond; {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {78201#false} assume !false; {78201#false} is VALID
[2022-04-08 10:12:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:12:52,541 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:12:53,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {78201#false} assume !false; {78201#false} is VALID
[2022-04-08 10:12:53,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {78201#false} assume 0 == ~cond; {78201#false} is VALID
[2022-04-08 10:12:53,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {78201#false} ~cond := #in~cond; {78201#false} is VALID
[2022-04-08 10:12:53,138 INFO L272 TraceCheckUtils]: 38: Hoare triple {78201#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78201#false} is VALID
[2022-04-08 10:12:53,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {78201#false} assume !(~y~0 % 4294967296 > 0); {78201#false} is VALID
[2022-04-08 10:12:53,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID
[2022-04-08 10:12:53,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {78400#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78201#false} is VALID
[2022-04-08 10:12:53,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {78404#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78400#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:12:53,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {78408#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78404#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:12:53,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {78412#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78408#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:12:53,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {78416#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78412#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:12:53,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {78420#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78416#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:12:53,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {78424#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78420#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:12:53,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {78428#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {78424#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:12:53,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {78428#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {78428#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:53,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {78435#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78428#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:53,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {78439#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78435#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:53,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {78443#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78439#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:53,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78443#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:12:53,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {78451#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:12:53,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {78455#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78451#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:12:53,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {78459#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78455#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:12:53,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {78463#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78459#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:12:53,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {78467#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78463#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:12:53,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {78471#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78467#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:12:53,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {78475#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78471#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:12:53,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {78200#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78475#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:12:53,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {78200#true} call #t~ret11 := main(); {78200#true} is VALID
[2022-04-08 10:12:53,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78200#true} {78200#true} #61#return; {78200#true} is VALID
[2022-04-08 10:12:53,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {78200#true} assume true; {78200#true} is VALID
[2022-04-08 10:12:53,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {78200#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78200#true} is VALID
[2022-04-08 10:12:53,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {78200#true} call ULTIMATE.init(); {78200#true} is VALID
[2022-04-08 10:12:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:12:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157047200] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:12:53,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:12:53,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42
[2022-04-08 10:12:53,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:12:53,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [163253500]
[2022-04-08 10:12:53,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [163253500] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:12:53,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:12:53,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2022-04-08 10:12:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073484981]
[2022-04-08 10:12:53,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:12:53,154 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:12:53,154 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:12:53,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:53,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:53,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2022-04-08 10:12:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:12:53,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2022-04-08 10:12:53,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722
[2022-04-08 10:12:53,176 INFO L87 Difference]: Start difference. First operand 142 states and 180 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:54,981 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions.
[2022-04-08 10:12:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2022-04-08 10:12:54,982 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:12:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:12:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions.
[2022-04-08 10:12:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions.
[2022-04-08 10:12:54,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions.
[2022-04-08 10:12:55,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:12:55,039 INFO L225 Difference]: With dead ends: 173
[2022-04-08 10:12:55,040 INFO L226 Difference]: Without dead ends: 156
[2022-04-08 10:12:55,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=803, Invalid=3619, Unknown=0, NotChecked=0, Total=4422
[2022-04-08 10:12:55,040 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:12:55,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:12:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2022-04-08 10:12:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143.
[2022-04-08 10:12:55,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:12:55,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:55,201 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:55,201 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:55,203 INFO L93 Difference]: Finished difference Result 156 states and 194 transitions.
[2022-04-08 10:12:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions.
[2022-04-08 10:12:55,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:55,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:55,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states.
[2022-04-08 10:12:55,203 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states.
[2022-04-08 10:12:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:12:55,204 INFO L93 Difference]: Finished difference Result 156 states and 194 transitions.
[2022-04-08 10:12:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions.
[2022-04-08 10:12:55,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:12:55,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:12:55,205 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:12:55,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:12:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions.
[2022-04-08 10:12:55,206 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 42
[2022-04-08 10:12:55,206 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:12:55,206 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions.
[2022-04-08 10:12:55,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:12:55,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 181 transitions.
[2022-04-08 10:13:00,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 180 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions.
[2022-04-08 10:13:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2022-04-08 10:13:00,307 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:13:00,307 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:13:00,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0
[2022-04-08 10:13:00,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:00,508 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:13:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:13:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash -820638515, now seen corresponding path program 129 times
[2022-04-08 10:13:00,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:00,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529987797]
[2022-04-08 10:13:00,510 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:13:00,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:13:00,510 INFO L85 PathProgramCache]: Analyzing trace with hash -820638515, now seen corresponding path program 130 times
[2022-04-08 10:13:00,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:13:00,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23354707]
[2022-04-08 10:13:00,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:13:00,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:13:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:13:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:00,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {79513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79490#true} is VALID
[2022-04-08 10:13:00,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {79490#true} assume true; {79490#true} is VALID
[2022-04-08 10:13:00,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79490#true} {79490#true} #61#return; {79490#true} is VALID
[2022-04-08 10:13:00,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {79490#true} call ULTIMATE.init(); {79513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:13:00,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {79513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79490#true} is VALID
[2022-04-08 10:13:00,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {79490#true} assume true; {79490#true} is VALID
[2022-04-08 10:13:00,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79490#true} {79490#true} #61#return; {79490#true} is VALID
[2022-04-08 10:13:00,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {79490#true} call #t~ret11 := main(); {79490#true} is VALID
[2022-04-08 10:13:00,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {79490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79495#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:00,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {79495#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:00,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {79496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:00,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {79497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:00,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {79498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:00,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {79499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:00,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {79500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79501#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:00,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {79501#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79502#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:00,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {79502#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79503#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:00,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {79503#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79504#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:00,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {79504#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79505#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:00,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {79505#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79506#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:00,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {79506#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:00,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:00,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {79508#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:13:00,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {79508#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79509#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:13:00,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {79509#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:13:00,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {79510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:13:00,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {79511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79512#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:13:00,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {79512#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {79491#false} assume !(~y~0 % 4294967296 > 0); {79491#false} is VALID
[2022-04-08 10:13:00,797 INFO L272 TraceCheckUtils]: 38: Hoare triple {79491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79491#false} is VALID
[2022-04-08 10:13:00,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {79491#false} ~cond := #in~cond; {79491#false} is VALID
[2022-04-08 10:13:00,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {79491#false} assume 0 == ~cond; {79491#false} is VALID
[2022-04-08 10:13:00,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {79491#false} assume !false; {79491#false} is VALID
[2022-04-08 10:13:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:13:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:13:00,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23354707]
[2022-04-08 10:13:00,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23354707] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:13:00,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744422756]
[2022-04-08 10:13:00,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:13:00,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:00,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:13:00,799 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:13:00,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process
[2022-04-08 10:13:00,843 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:13:00,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:13:00,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjunts are in the unsatisfiable core
[2022-04-08 10:13:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:00,853 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:13:01,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {79490#true} call ULTIMATE.init(); {79490#true} is VALID
[2022-04-08 10:13:01,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {79490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79490#true} is VALID
[2022-04-08 10:13:01,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {79490#true} assume true; {79490#true} is VALID
[2022-04-08 10:13:01,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79490#true} {79490#true} #61#return; {79490#true} is VALID
[2022-04-08 10:13:01,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {79490#true} call #t~ret11 := main(); {79490#true} is VALID
[2022-04-08 10:13:01,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {79490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79495#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:01,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {79495#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:01,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {79496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:01,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {79497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:01,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {79498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:01,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {79499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:01,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {79500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79501#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:01,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {79501#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79502#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:01,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {79502#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79503#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:01,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {79503#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79504#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:01,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {79504#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79505#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:01,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {79505#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79506#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:01,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {79506#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:01,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:01,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {79508#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:13:01,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {79508#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79509#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:13:01,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {79509#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:13:01,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {79510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:13:01,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {79511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79586#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:13:01,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {79586#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {79491#false} is VALID
[2022-04-08 10:13:01,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {79491#false} assume !(~y~0 % 4294967296 > 0); {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L272 TraceCheckUtils]: 38: Hoare triple {79491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {79491#false} ~cond := #in~cond; {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {79491#false} assume 0 == ~cond; {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {79491#false} assume !false; {79491#false} is VALID
[2022-04-08 10:13:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:13:01,138 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:13:01,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {79491#false} assume !false; {79491#false} is VALID
[2022-04-08 10:13:01,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {79491#false} assume 0 == ~cond; {79491#false} is VALID
[2022-04-08 10:13:01,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {79491#false} ~cond := #in~cond; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L272 TraceCheckUtils]: 38: Hoare triple {79491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {79491#false} assume !(~y~0 % 4294967296 > 0); {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID
[2022-04-08 10:13:01,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {79692#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {79491#false} is VALID
[2022-04-08 10:13:01,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {79696#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79692#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:13:01,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {79700#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79696#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:01,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {79704#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79700#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:13:01,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {79708#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79704#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:13:01,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {79712#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {79708#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:13:01,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {79712#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {79712#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:01,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {79719#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79712#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:01,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {79723#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79719#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:13:01,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {79727#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79723#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:13:01,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {79731#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79727#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:01,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {79735#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79731#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:13:01,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {79739#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79735#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:13:01,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {79743#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79739#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:13:01,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {79747#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79743#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:13:01,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {79751#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79747#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:13:01,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {79755#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79751#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:01,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {79759#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79755#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:13:01,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {79763#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {79759#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:01,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {79490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79763#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:13:01,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {79490#true} call #t~ret11 := main(); {79490#true} is VALID
[2022-04-08 10:13:01,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79490#true} {79490#true} #61#return; {79490#true} is VALID
[2022-04-08 10:13:01,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {79490#true} assume true; {79490#true} is VALID
[2022-04-08 10:13:01,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {79490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {79490#true} is VALID
[2022-04-08 10:13:01,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {79490#true} call ULTIMATE.init(); {79490#true} is VALID
[2022-04-08 10:13:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:13:01,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744422756] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:13:01,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:13:01,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40
[2022-04-08 10:13:01,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:13:01,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529987797]
[2022-04-08 10:13:01,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529987797] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:13:01,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:13:01,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2022-04-08 10:13:01,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668497028]
[2022-04-08 10:13:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:13:01,712 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:13:01,713 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:13:01,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:01,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:01,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2022-04-08 10:13:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:01,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2022-04-08 10:13:01,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560
[2022-04-08 10:13:01,732 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:03,681 INFO L93 Difference]: Finished difference Result 176 states and 214 transitions.
[2022-04-08 10:13:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2022-04-08 10:13:03,681 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:13:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:13:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions.
[2022-04-08 10:13:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions.
[2022-04-08 10:13:03,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions.
[2022-04-08 10:13:03,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:03,744 INFO L225 Difference]: With dead ends: 176
[2022-04-08 10:13:03,744 INFO L226 Difference]: Without dead ends: 158
[2022-04-08 10:13:03,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=798, Invalid=3362, Unknown=0, NotChecked=0, Total=4160
[2022-04-08 10:13:03,745 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-04-08 10:13:03,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-04-08 10:13:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2022-04-08 10:13:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144.
[2022-04-08 10:13:03,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:13:03,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:03,908 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:03,908 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:03,909 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions.
[2022-04-08 10:13:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions.
[2022-04-08 10:13:03,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:03,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:03,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states.
[2022-04-08 10:13:03,910 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states.
[2022-04-08 10:13:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:03,911 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions.
[2022-04-08 10:13:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions.
[2022-04-08 10:13:03,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:03,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:03,911 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:13:03,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:13:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions.
[2022-04-08 10:13:03,913 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 42
[2022-04-08 10:13:03,913 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:13:03,913 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions.
[2022-04-08 10:13:03,913 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:03,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 182 transitions.
[2022-04-08 10:13:07,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 181 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions.
[2022-04-08 10:13:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2022-04-08 10:13:07,985 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:13:07,985 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:13:08,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0
[2022-04-08 10:13:08,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:08,186 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:13:08,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:13:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1353729153, now seen corresponding path program 131 times
[2022-04-08 10:13:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:08,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298272876]
[2022-04-08 10:13:08,188 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:13:08,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:13:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1353729153, now seen corresponding path program 132 times
[2022-04-08 10:13:08,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:13:08,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107171137]
[2022-04-08 10:13:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:13:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:13:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:13:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:08,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {80812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80790#true} is VALID
[2022-04-08 10:13:08,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {80790#true} assume true; {80790#true} is VALID
[2022-04-08 10:13:08,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80790#true} {80790#true} #61#return; {80790#true} is VALID
[2022-04-08 10:13:08,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {80790#true} call ULTIMATE.init(); {80812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:13:08,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {80812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80790#true} is VALID
[2022-04-08 10:13:08,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {80790#true} assume true; {80790#true} is VALID
[2022-04-08 10:13:08,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80790#true} {80790#true} #61#return; {80790#true} is VALID
[2022-04-08 10:13:08,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {80790#true} call #t~ret11 := main(); {80790#true} is VALID
[2022-04-08 10:13:08,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {80790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80795#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:08,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {80795#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:08,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {80796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:08,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {80797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:08,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {80798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:08,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {80799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:08,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {80800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:08,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {80801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:08,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {80802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:08,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {80803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:08,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {80804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:08,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {80805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:08,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {80806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80807#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:08,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {80807#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:08,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {80808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {80808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:08,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {80808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {80809#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID
[2022-04-08 10:13:08,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {80809#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80810#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:13:08,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {80810#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80811#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {80811#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {80791#false} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {80791#false} assume !(~y~0 % 4294967296 > 0); {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L272 TraceCheckUtils]: 38: Hoare triple {80791#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {80791#false} ~cond := #in~cond; {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {80791#false} assume 0 == ~cond; {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {80791#false} assume !false; {80791#false} is VALID
[2022-04-08 10:13:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2022-04-08 10:13:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:13:08,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107171137]
[2022-04-08 10:13:08,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107171137] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:13:08,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276840645]
[2022-04-08 10:13:08,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:13:08,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:08,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:13:08,455 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:13:08,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process
[2022-04-08 10:13:08,708 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2022-04-08 10:13:08,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:13:08,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjunts are in the unsatisfiable core
[2022-04-08 10:13:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:08,720 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:13:08,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {80790#true} call ULTIMATE.init(); {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {80790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {80790#true} assume true; {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80790#true} {80790#true} #61#return; {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {80790#true} call #t~ret11 := main(); {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {80790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:08,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {80790#true} assume !(~x~0 % 4294967296 > 0); {80790#true} is VALID
[2022-04-08 10:13:08,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {80790#true} ~z~0 := ~y~0; {80876#(= main_~z~0 main_~y~0)} is VALID
[2022-04-08 10:13:08,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {80876#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80880#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:13:08,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {80880#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80884#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:13:08,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {80884#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {80888#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID
[2022-04-08 10:13:08,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {80888#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID
[2022-04-08 10:13:08,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {80892#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80896#(<= (mod main_~y~0 4294967296) 0)} is VALID
[2022-04-08 10:13:08,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {80896#(<= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {80791#false} assume !(~y~0 % 4294967296 > 0); {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L272 TraceCheckUtils]: 38: Hoare triple {80791#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {80791#false} ~cond := #in~cond; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {80791#false} assume 0 == ~cond; {80791#false} is VALID
[2022-04-08 10:13:08,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {80791#false} assume !false; {80791#false} is VALID
[2022-04-08 10:13:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked.
[2022-04-08 10:13:08,934 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:13:09,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {80791#false} assume !false; {80791#false} is VALID
[2022-04-08 10:13:09,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {80791#false} assume 0 == ~cond; {80791#false} is VALID
[2022-04-08 10:13:09,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {80791#false} ~cond := #in~cond; {80791#false} is VALID
[2022-04-08 10:13:09,145 INFO L272 TraceCheckUtils]: 38: Hoare triple {80791#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80791#false} is VALID
[2022-04-08 10:13:09,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {80791#false} assume !(~y~0 % 4294967296 > 0); {80791#false} is VALID
[2022-04-08 10:13:09,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {80896#(<= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID
[2022-04-08 10:13:09,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {80892#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80896#(<= (mod main_~y~0 4294967296) 0)} is VALID
[2022-04-08 10:13:09,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {80888#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID
[2022-04-08 10:13:09,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {80999#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {80888#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID
[2022-04-08 10:13:09,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {81003#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80999#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID
[2022-04-08 10:13:09,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {81007#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81003#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:13:09,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {80790#true} ~z~0 := ~y~0; {81007#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID
[2022-04-08 10:13:09,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {80790#true} assume !(~x~0 % 4294967296 > 0); {80790#true} is VALID
[2022-04-08 10:13:09,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {80790#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {80790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {80790#true} call #t~ret11 := main(); {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80790#true} {80790#true} #61#return; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {80790#true} assume true; {80790#true} is VALID
[2022-04-08 10:13:09,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {80790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80790#true} is VALID
[2022-04-08 10:13:09,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {80790#true} call ULTIMATE.init(); {80790#true} is VALID
[2022-04-08 10:13:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked.
[2022-04-08 10:13:09,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276840645] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:13:09,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:13:09,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8, 8] total 29
[2022-04-08 10:13:09,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:13:09,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298272876]
[2022-04-08 10:13:09,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298272876] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:13:09,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:13:09,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-04-08 10:13:09,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382549984]
[2022-04-08 10:13:09,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:13:09,153 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:13:09,153 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:13:09,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:09,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:09,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-04-08 10:13:09,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:09,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-04-08 10:13:09,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812
[2022-04-08 10:13:09,171 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:10,950 INFO L93 Difference]: Finished difference Result 179 states and 217 transitions.
[2022-04-08 10:13:10,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2022-04-08 10:13:10,950 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:13:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:13:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions.
[2022-04-08 10:13:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions.
[2022-04-08 10:13:10,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions.
[2022-04-08 10:13:11,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:11,012 INFO L225 Difference]: With dead ends: 179
[2022-04-08 10:13:11,012 INFO L226 Difference]: Without dead ends: 160
[2022-04-08 10:13:11,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=2149, Unknown=0, NotChecked=0, Total=2352
[2022-04-08 10:13:11,013 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-04-08 10:13:11,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 105 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-04-08 10:13:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2022-04-08 10:13:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145.
[2022-04-08 10:13:11,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:13:11,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:11,176 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:11,176 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:11,177 INFO L93 Difference]: Finished difference Result 160 states and 198 transitions.
[2022-04-08 10:13:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions.
[2022-04-08 10:13:11,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:11,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:11,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states.
[2022-04-08 10:13:11,178 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states.
[2022-04-08 10:13:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:11,179 INFO L93 Difference]: Finished difference Result 160 states and 198 transitions.
[2022-04-08 10:13:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions.
[2022-04-08 10:13:11,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:11,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:11,179 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:13:11,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:13:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions.
[2022-04-08 10:13:11,181 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 42
[2022-04-08 10:13:11,181 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:13:11,181 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions.
[2022-04-08 10:13:11,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:11,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 183 transitions.
[2022-04-08 10:13:12,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions.
[2022-04-08 10:13:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2022-04-08 10:13:12,315 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:13:12,315 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:13:12,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0
[2022-04-08 10:13:12,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:12,515 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:13:12,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:13:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1829652723, now seen corresponding path program 55 times
[2022-04-08 10:13:12,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:12,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939079393]
[2022-04-08 10:13:12,519 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:13:12,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:13:12,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1829652723, now seen corresponding path program 56 times
[2022-04-08 10:13:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:13:12,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233618575]
[2022-04-08 10:13:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:13:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:13:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:13,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:13:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:13,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {82116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {82081#true} is VALID
[2022-04-08 10:13:13,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {82081#true} assume true; {82081#true} is VALID
[2022-04-08 10:13:13,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82081#true} {82081#true} #61#return; {82081#true} is VALID
[2022-04-08 10:13:13,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {82081#true} call ULTIMATE.init(); {82116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:13:13,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {82116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {82081#true} is VALID
[2022-04-08 10:13:13,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {82081#true} assume true; {82081#true} is VALID
[2022-04-08 10:13:13,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82081#true} {82081#true} #61#return; {82081#true} is VALID
[2022-04-08 10:13:13,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {82081#true} call #t~ret11 := main(); {82081#true} is VALID
[2022-04-08 10:13:13,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {82081#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82086#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:13,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {82086#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82087#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:13,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {82087#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82088#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:13,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {82088#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82089#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:13,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {82089#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82090#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:13,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {82090#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82091#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:13,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {82091#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82092#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:13,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {82092#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82093#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:13,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {82093#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82094#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:13,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {82094#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82095#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:13,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {82095#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82096#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:13,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {82096#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82097#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:13,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {82097#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82098#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:13,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {82098#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82099#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:13,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {82099#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82100#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:13:13,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {82100#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82101#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:13:13,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {82101#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82102#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:13:13,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {82102#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82103#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:13:13,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {82103#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82104#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:13:13,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {82104#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82105#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:13:13,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {82105#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82106#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:13:13,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {82106#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82107#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:13:13,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {82107#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82108#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:13:13,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {82108#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82109#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:13:13,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {82109#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82110#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:13:13,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {82110#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82111#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:13:13,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {82111#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82112#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:13:13,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {82112#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82113#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID
[2022-04-08 10:13:13,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {82113#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID
[2022-04-08 10:13:13,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID
[2022-04-08 10:13:13,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {82115#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} is VALID
[2022-04-08 10:13:13,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {82115#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {82082#false} is VALID
[2022-04-08 10:13:13,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {82082#false} assume !(~y~0 % 4294967296 > 0); {82082#false} is VALID
[2022-04-08 10:13:13,109 INFO L272 TraceCheckUtils]: 38: Hoare triple {82082#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82082#false} is VALID
[2022-04-08 10:13:13,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {82082#false} ~cond := #in~cond; {82082#false} is VALID
[2022-04-08 10:13:13,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {82082#false} assume 0 == ~cond; {82082#false} is VALID
[2022-04-08 10:13:13,109 INFO L290 TraceCheckUtils]: 41: Hoare triple {82082#false} assume !false; {82082#false} is VALID
[2022-04-08 10:13:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:13:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:13:13,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233618575]
[2022-04-08 10:13:13,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233618575] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:13:13,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889626176]
[2022-04-08 10:13:13,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:13:13,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:13,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:13:13,111 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:13:13,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process
[2022-04-08 10:13:13,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:13:13,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:13:13,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 61 conjunts are in the unsatisfiable core
[2022-04-08 10:13:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:13,167 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:13:13,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {82081#true} call ULTIMATE.init(); {82081#true} is VALID
[2022-04-08 10:13:13,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {82081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {82081#true} is VALID
[2022-04-08 10:13:13,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {82081#true} assume true; {82081#true} is VALID
[2022-04-08 10:13:13,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82081#true} {82081#true} #61#return; {82081#true} is VALID
[2022-04-08 10:13:13,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {82081#true} call #t~ret11 := main(); {82081#true} is VALID
[2022-04-08 10:13:13,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {82081#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82086#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:13,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {82086#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82087#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:13,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {82087#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82088#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:13,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {82088#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82089#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:13,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {82089#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82090#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:13,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {82090#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82091#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:13,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {82091#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82092#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:13,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {82092#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82093#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:13,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {82093#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82094#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:13,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {82094#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82095#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:13,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {82095#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82096#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:13,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {82096#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82097#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:13,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {82097#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82098#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:13,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {82098#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82099#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:13,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {82099#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82100#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:13:13,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {82100#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82101#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:13:13,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {82101#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82102#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:13:13,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {82102#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82103#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:13:13,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {82103#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82104#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:13:13,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {82104#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82105#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:13:13,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {82105#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82106#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:13:13,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {82106#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82107#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:13:13,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {82107#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82108#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:13:13,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {82108#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82109#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:13:13,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {82109#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82110#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:13:13,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {82110#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82111#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:13:13,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {82111#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82112#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:13:13,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {82112#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82113#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID
[2022-04-08 10:13:13,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {82113#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID
[2022-04-08 10:13:13,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID
[2022-04-08 10:13:13,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {82225#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID
[2022-04-08 10:13:13,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {82225#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !(~z~0 % 4294967296 > 0); {82082#false} is VALID
[2022-04-08 10:13:13,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {82082#false} assume !(~y~0 % 4294967296 > 0); {82082#false} is VALID
[2022-04-08 10:13:13,554 INFO L272 TraceCheckUtils]: 38: Hoare triple {82082#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82082#false} is VALID
[2022-04-08 10:13:13,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {82082#false} ~cond := #in~cond; {82082#false} is VALID
[2022-04-08 10:13:13,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {82082#false} assume 0 == ~cond; {82082#false} is VALID
[2022-04-08 10:13:13,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {82082#false} assume !false; {82082#false} is VALID
[2022-04-08 10:13:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:13:13,554 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:13:14,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {82082#false} assume !false; {82082#false} is VALID
[2022-04-08 10:13:14,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {82082#false} assume 0 == ~cond; {82082#false} is VALID
[2022-04-08 10:13:14,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {82082#false} ~cond := #in~cond; {82082#false} is VALID
[2022-04-08 10:13:14,962 INFO L272 TraceCheckUtils]: 38: Hoare triple {82082#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82082#false} is VALID
[2022-04-08 10:13:14,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {82082#false} assume !(~y~0 % 4294967296 > 0); {82082#false} is VALID
[2022-04-08 10:13:14,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {82259#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {82082#false} is VALID
[2022-04-08 10:13:14,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {82263#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {82259#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:13:14,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {82263#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {82263#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:13:14,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {82270#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82263#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:13:14,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {82274#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82270#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:13:14,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {82278#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82274#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:13:14,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {82282#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82278#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:13:14,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {82286#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82282#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:13:14,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {82290#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82286#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:14,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {82294#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82290#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:13:14,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {82298#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82294#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:14,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {82302#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82298#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:13:14,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {82306#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82302#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:13:14,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {82310#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82306#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:13:14,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {82314#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82310#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:13:14,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {82318#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82314#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:13:14,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {82322#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82318#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:13:14,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {82326#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82322#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:13:14,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {82330#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82326#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:13:14,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {82334#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82330#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:13:14,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {82338#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82334#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:13:14,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {82342#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82338#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:13:14,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {82346#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82342#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:14,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {82350#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82346#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:13:14,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {82354#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82350#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID
[2022-04-08 10:13:14,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {82358#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82354#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID
[2022-04-08 10:13:14,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {82362#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82358#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:14,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {82366#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82362#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID
[2022-04-08 10:13:14,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {82370#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82366#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID
[2022-04-08 10:13:14,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {82374#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82370#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID
[2022-04-08 10:13:14,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {82378#(< 0 (mod (+ main_~y~0 28) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {82374#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID
[2022-04-08 10:13:14,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {82081#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82378#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID
[2022-04-08 10:13:14,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {82081#true} call #t~ret11 := main(); {82081#true} is VALID
[2022-04-08 10:13:14,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82081#true} {82081#true} #61#return; {82081#true} is VALID
[2022-04-08 10:13:14,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {82081#true} assume true; {82081#true} is VALID
[2022-04-08 10:13:14,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {82081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {82081#true} is VALID
[2022-04-08 10:13:14,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {82081#true} call ULTIMATE.init(); {82081#true} is VALID
[2022-04-08 10:13:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:13:14,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889626176] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:13:14,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:13:14,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64
[2022-04-08 10:13:14,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:13:14,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939079393]
[2022-04-08 10:13:14,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939079393] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:13:14,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:13:14,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2022-04-08 10:13:14,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561061511]
[2022-04-08 10:13:14,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:13:14,983 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:13:14,983 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:13:14,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:15,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:15,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-04-08 10:13:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:15,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-04-08 10:13:15,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=968, Invalid=3064, Unknown=0, NotChecked=0, Total=4032
[2022-04-08 10:13:15,007 INFO L87 Difference]: Start difference. First operand 145 states and 183 transitions. Second operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:21,512 INFO L93 Difference]: Finished difference Result 185 states and 255 transitions.
[2022-04-08 10:13:21,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2022-04-08 10:13:21,512 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42
[2022-04-08 10:13:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:13:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 189 transitions.
[2022-04-08 10:13:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 189 transitions.
[2022-04-08 10:13:21,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 189 transitions.
[2022-04-08 10:13:21,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:21,662 INFO L225 Difference]: With dead ends: 185
[2022-04-08 10:13:21,662 INFO L226 Difference]: Without dead ends: 179
[2022-04-08 10:13:21,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1960, Invalid=6782, Unknown=0, NotChecked=0, Total=8742
[2022-04-08 10:13:21,663 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 164 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4115 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 4234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 4115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2022-04-08 10:13:21,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 218 Invalid, 4234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 4115 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2022-04-08 10:13:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2022-04-08 10:13:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150.
[2022-04-08 10:13:21,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:13:21,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:21,857 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:21,857 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:21,859 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions.
[2022-04-08 10:13:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 219 transitions.
[2022-04-08 10:13:21,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:21,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:21,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states.
[2022-04-08 10:13:21,859 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states.
[2022-04-08 10:13:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:21,861 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions.
[2022-04-08 10:13:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 219 transitions.
[2022-04-08 10:13:21,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:21,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:21,861 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:13:21,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:13:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions.
[2022-04-08 10:13:21,863 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 42
[2022-04-08 10:13:21,863 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:13:21,866 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions.
[2022-04-08 10:13:21,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:21,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 190 transitions.
[2022-04-08 10:13:23,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions.
[2022-04-08 10:13:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-04-08 10:13:23,879 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:13:23,880 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:13:23,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0
[2022-04-08 10:13:24,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:24,080 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:13:24,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:13:24,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2101683985, now seen corresponding path program 133 times
[2022-04-08 10:13:24,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:24,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2015944823]
[2022-04-08 10:13:24,082 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:13:24,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:13:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2101683985, now seen corresponding path program 134 times
[2022-04-08 10:13:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:13:24,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589621135]
[2022-04-08 10:13:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:13:24,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:13:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:24,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:13:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:24,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {83513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83487#true} is VALID
[2022-04-08 10:13:24,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {83487#true} assume true; {83487#true} is VALID
[2022-04-08 10:13:24,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83487#true} {83487#true} #61#return; {83487#true} is VALID
[2022-04-08 10:13:24,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {83487#true} call ULTIMATE.init(); {83513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:13:24,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {83513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83487#true} is VALID
[2022-04-08 10:13:24,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {83487#true} assume true; {83487#true} is VALID
[2022-04-08 10:13:24,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83487#true} {83487#true} #61#return; {83487#true} is VALID
[2022-04-08 10:13:24,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {83487#true} call #t~ret11 := main(); {83487#true} is VALID
[2022-04-08 10:13:24,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {83487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83492#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:24,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {83492#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83493#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:24,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {83493#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:24,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {83494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83495#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:24,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {83495#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83496#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:24,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {83496#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83497#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:24,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {83497#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83498#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:24,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {83498#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:24,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {83499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83500#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:24,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {83500#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83501#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:24,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {83501#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:24,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:24,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {83503#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:13:24,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {83503#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83504#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:13:24,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {83504#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83505#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:13:24,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {83505#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83506#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:13:24,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {83506#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83507#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:13:24,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {83507#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83508#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:13:24,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {83508#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83509#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:13:24,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {83509#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83510#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID
[2022-04-08 10:13:24,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {83510#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83511#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID
[2022-04-08 10:13:24,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {83511#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83512#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {83512#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {83488#false} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {83488#false} assume !(~y~0 % 4294967296 > 0); {83488#false} is VALID
[2022-04-08 10:13:24,459 INFO L272 TraceCheckUtils]: 39: Hoare triple {83488#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83488#false} is VALID
[2022-04-08 10:13:24,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {83488#false} ~cond := #in~cond; {83488#false} is VALID
[2022-04-08 10:13:24,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {83488#false} assume 0 == ~cond; {83488#false} is VALID
[2022-04-08 10:13:24,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {83488#false} assume !false; {83488#false} is VALID
[2022-04-08 10:13:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:13:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:13:24,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589621135]
[2022-04-08 10:13:24,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589621135] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:13:24,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560818621]
[2022-04-08 10:13:24,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:13:24,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:24,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:13:24,460 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:13:24,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process
[2022-04-08 10:13:24,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:13:24,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:13:24,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 62 conjunts are in the unsatisfiable core
[2022-04-08 10:13:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:24,518 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:13:24,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {83487#true} call ULTIMATE.init(); {83487#true} is VALID
[2022-04-08 10:13:24,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {83487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83487#true} is VALID
[2022-04-08 10:13:24,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {83487#true} assume true; {83487#true} is VALID
[2022-04-08 10:13:24,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83487#true} {83487#true} #61#return; {83487#true} is VALID
[2022-04-08 10:13:24,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {83487#true} call #t~ret11 := main(); {83487#true} is VALID
[2022-04-08 10:13:24,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {83487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83492#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:24,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {83492#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83493#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:24,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {83493#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:24,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {83494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83495#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:24,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {83495#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83496#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:24,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {83496#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83497#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:24,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {83497#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83498#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:24,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {83498#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:24,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {83499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83500#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:24,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {83500#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83501#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:24,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {83501#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:24,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:24,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {83568#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:24,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {83568#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83572#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:13:24,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {83572#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83576#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:24,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {83576#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83580#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID
[2022-04-08 10:13:24,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {83580#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83584#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 4)))} is VALID
[2022-04-08 10:13:24,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {83584#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83588#(and (= (+ 5 main_~z~0) main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:24,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {83588#(and (= (+ 5 main_~z~0) main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83592#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:24,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {83592#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83596#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} is VALID
[2022-04-08 10:13:24,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {83596#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83600#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))))} is VALID
[2022-04-08 10:13:24,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {83600#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83604#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))))} is VALID
[2022-04-08 10:13:24,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {83604#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))))} assume !(~z~0 % 4294967296 > 0); {83488#false} is VALID
[2022-04-08 10:13:24,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {83488#false} assume !(~y~0 % 4294967296 > 0); {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L272 TraceCheckUtils]: 39: Hoare triple {83488#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {83488#false} ~cond := #in~cond; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {83488#false} assume 0 == ~cond; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {83488#false} assume !false; {83488#false} is VALID
[2022-04-08 10:13:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:13:24,986 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:13:25,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {83488#false} assume !false; {83488#false} is VALID
[2022-04-08 10:13:25,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {83488#false} assume 0 == ~cond; {83488#false} is VALID
[2022-04-08 10:13:25,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {83488#false} ~cond := #in~cond; {83488#false} is VALID
[2022-04-08 10:13:25,788 INFO L272 TraceCheckUtils]: 39: Hoare triple {83488#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83488#false} is VALID
[2022-04-08 10:13:25,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {83488#false} assume !(~y~0 % 4294967296 > 0); {83488#false} is VALID
[2022-04-08 10:13:25,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {83668#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID
[2022-04-08 10:13:25,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {83672#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83668#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:13:25,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {83676#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83672#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:13:25,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {83680#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83676#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:13:25,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {83684#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83680#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:13:25,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {83688#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83684#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:13:25,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {83692#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83688#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:13:25,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {83696#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83692#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:13:25,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {83700#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83696#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:13:25,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {83704#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83700#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:13:25,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {83708#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {83704#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID
[2022-04-08 10:13:25,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {83712#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83708#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:13:25,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {83716#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83712#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:13:25,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {83720#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83716#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:13:25,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {83724#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83720#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:13:25,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {83728#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83724#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:13:25,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {83732#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83728#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:13:25,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {83736#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83732#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:13:25,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {83740#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83736#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:13:25,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {83744#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83740#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:13:25,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {83487#true} ~z~0 := ~y~0; {83744#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID
[2022-04-08 10:13:25,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {83487#true} assume !(~x~0 % 4294967296 > 0); {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {83487#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {83487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {83487#true} call #t~ret11 := main(); {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83487#true} {83487#true} #61#return; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {83487#true} assume true; {83487#true} is VALID
[2022-04-08 10:13:25,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {83487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83487#true} is VALID
[2022-04-08 10:13:25,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {83487#true} call ULTIMATE.init(); {83487#true} is VALID
[2022-04-08 10:13:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2022-04-08 10:13:25,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560818621] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:13:25,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:13:25,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 54
[2022-04-08 10:13:25,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:13:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2015944823]
[2022-04-08 10:13:25,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2015944823] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:13:25,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:13:25,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2022-04-08 10:13:25,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778030266]
[2022-04-08 10:13:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:13:25,806 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:13:25,806 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:13:25,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:25,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:25,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2022-04-08 10:13:25,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:25,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2022-04-08 10:13:25,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862
[2022-04-08 10:13:25,827 INFO L87 Difference]: Start difference. First operand 150 states and 190 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:27,431 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions.
[2022-04-08 10:13:27,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2022-04-08 10:13:27,431 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:13:27,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:13:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions.
[2022-04-08 10:13:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions.
[2022-04-08 10:13:27,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 61 transitions.
[2022-04-08 10:13:27,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:27,479 INFO L225 Difference]: With dead ends: 179
[2022-04-08 10:13:27,480 INFO L226 Difference]: Without dead ends: 163
[2022-04-08 10:13:27,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=581, Invalid=4969, Unknown=0, NotChecked=0, Total=5550
[2022-04-08 10:13:27,480 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:13:27,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-08 10:13:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states.
[2022-04-08 10:13:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151.
[2022-04-08 10:13:27,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:13:27,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:27,650 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:27,651 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:27,652 INFO L93 Difference]: Finished difference Result 163 states and 203 transitions.
[2022-04-08 10:13:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 203 transitions.
[2022-04-08 10:13:27,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:27,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:27,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states.
[2022-04-08 10:13:27,653 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states.
[2022-04-08 10:13:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:27,654 INFO L93 Difference]: Finished difference Result 163 states and 203 transitions.
[2022-04-08 10:13:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 203 transitions.
[2022-04-08 10:13:27,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:27,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:27,655 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:13:27,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:13:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 191 transitions.
[2022-04-08 10:13:27,657 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 191 transitions. Word has length 43
[2022-04-08 10:13:27,657 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:13:27,657 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 191 transitions.
[2022-04-08 10:13:27,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:27,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 191 transitions.
[2022-04-08 10:13:34,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 189 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 191 transitions.
[2022-04-08 10:13:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-04-08 10:13:34,640 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:13:34,640 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:13:34,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0
[2022-04-08 10:13:34,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95
[2022-04-08 10:13:34,841 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:13:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:13:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash 396811007, now seen corresponding path program 135 times
[2022-04-08 10:13:34,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:34,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1067806458]
[2022-04-08 10:13:34,843 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:13:34,843 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:13:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 396811007, now seen corresponding path program 136 times
[2022-04-08 10:13:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:13:34,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973243565]
[2022-04-08 10:13:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:13:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:13:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:13:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:35,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {84854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84829#true} is VALID
[2022-04-08 10:13:35,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {84829#true} assume true; {84829#true} is VALID
[2022-04-08 10:13:35,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84829#true} {84829#true} #61#return; {84829#true} is VALID
[2022-04-08 10:13:35,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {84829#true} call ULTIMATE.init(); {84854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:13:35,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {84854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84829#true} is VALID
[2022-04-08 10:13:35,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {84829#true} assume true; {84829#true} is VALID
[2022-04-08 10:13:35,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84829#true} {84829#true} #61#return; {84829#true} is VALID
[2022-04-08 10:13:35,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {84829#true} call #t~ret11 := main(); {84829#true} is VALID
[2022-04-08 10:13:35,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {84829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84834#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:35,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {84834#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84835#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:35,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {84835#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:35,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {84836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84837#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:35,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {84837#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84838#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:35,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {84838#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84839#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:35,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {84839#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84840#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:35,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {84840#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:35,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {84841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84842#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:35,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {84842#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84843#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:35,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {84843#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84844#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:35,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {84844#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:35,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:35,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {84846#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:13:35,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {84846#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84847#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:13:35,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {84847#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84848#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:13:35,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {84848#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84849#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:13:35,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {84849#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84850#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:13:35,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {84850#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84851#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:13:35,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {84851#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84852#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:13:35,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {84852#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84853#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:13:35,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {84853#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {84830#false} is VALID
[2022-04-08 10:13:35,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {84830#false} assume !(~y~0 % 4294967296 > 0); {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L272 TraceCheckUtils]: 39: Hoare triple {84830#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {84830#false} ~cond := #in~cond; {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {84830#false} assume 0 == ~cond; {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L290 TraceCheckUtils]: 42: Hoare triple {84830#false} assume !false; {84830#false} is VALID
[2022-04-08 10:13:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:13:35,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:13:35,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973243565]
[2022-04-08 10:13:35,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973243565] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:13:35,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784935475]
[2022-04-08 10:13:35,179 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:13:35,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:35,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:13:35,179 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:13:35,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process
[2022-04-08 10:13:35,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:13:35,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:13:35,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 41 conjunts are in the unsatisfiable core
[2022-04-08 10:13:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:35,244 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:13:35,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {84829#true} call ULTIMATE.init(); {84829#true} is VALID
[2022-04-08 10:13:35,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {84829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84829#true} is VALID
[2022-04-08 10:13:35,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {84829#true} assume true; {84829#true} is VALID
[2022-04-08 10:13:35,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84829#true} {84829#true} #61#return; {84829#true} is VALID
[2022-04-08 10:13:35,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {84829#true} call #t~ret11 := main(); {84829#true} is VALID
[2022-04-08 10:13:35,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {84829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84834#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:35,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {84834#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84835#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:35,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {84835#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:35,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {84836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84837#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:35,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {84837#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84838#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:35,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {84838#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84839#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:35,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {84839#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84840#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:35,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {84840#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:35,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {84841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84842#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:35,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {84842#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84843#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:35,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {84843#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84844#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:35,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {84844#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:35,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:35,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {84846#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:13:35,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {84846#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84847#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:13:35,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {84847#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84848#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:13:35,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {84848#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84849#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:13:35,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {84849#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84850#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:13:35,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {84850#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84851#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:13:35,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {84851#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84852#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:13:35,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {84852#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84933#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {84933#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {84830#false} assume !(~y~0 % 4294967296 > 0); {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L272 TraceCheckUtils]: 39: Hoare triple {84830#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84830#false} is VALID
[2022-04-08 10:13:35,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {84830#false} ~cond := #in~cond; {84830#false} is VALID
[2022-04-08 10:13:35,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {84830#false} assume 0 == ~cond; {84830#false} is VALID
[2022-04-08 10:13:35,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {84830#false} assume !false; {84830#false} is VALID
[2022-04-08 10:13:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:13:35,537 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:13:36,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {84830#false} assume !false; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {84830#false} assume 0 == ~cond; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {84830#false} ~cond := #in~cond; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L272 TraceCheckUtils]: 39: Hoare triple {84830#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {84830#false} assume !(~y~0 % 4294967296 > 0); {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID
[2022-04-08 10:13:36,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {85033#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {84830#false} is VALID
[2022-04-08 10:13:36,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {85037#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85033#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:13:36,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {85041#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85037#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:36,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {85045#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85041#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:13:36,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {85049#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85045#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:13:36,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {85053#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85049#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:13:36,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {85057#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85053#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:13:36,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {85061#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85057#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:13:36,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {85065#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {85061#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID
[2022-04-08 10:13:36,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {85065#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {85065#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID
[2022-04-08 10:13:36,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {85072#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85065#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID
[2022-04-08 10:13:36,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {85076#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85072#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:36,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {85080#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85076#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:36,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {85084#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85080#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:36,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {85088#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85084#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:13:36,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {85092#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85088#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:13:36,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {85096#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85092#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:36,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {85100#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85096#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:13:36,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {85104#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85100#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:13:36,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {85108#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85104#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:13:36,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {85112#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85108#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:13:36,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {84829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85112#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:13:36,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {84829#true} call #t~ret11 := main(); {84829#true} is VALID
[2022-04-08 10:13:36,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84829#true} {84829#true} #61#return; {84829#true} is VALID
[2022-04-08 10:13:36,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {84829#true} assume true; {84829#true} is VALID
[2022-04-08 10:13:36,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {84829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {84829#true} is VALID
[2022-04-08 10:13:36,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {84829#true} call ULTIMATE.init(); {84829#true} is VALID
[2022-04-08 10:13:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:13:36,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784935475] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:13:36,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:13:36,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44
[2022-04-08 10:13:36,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:13:36,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1067806458]
[2022-04-08 10:13:36,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1067806458] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:13:36,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:13:36,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-04-08 10:13:36,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816361061]
[2022-04-08 10:13:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:13:36,190 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:13:36,190 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:13:36,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:36,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:36,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-04-08 10:13:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:36,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-04-08 10:13:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892
[2022-04-08 10:13:36,215 INFO L87 Difference]: Start difference. First operand 151 states and 191 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:38,168 INFO L93 Difference]: Finished difference Result 182 states and 222 transitions.
[2022-04-08 10:13:38,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2022-04-08 10:13:38,168 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:13:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:13:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions.
[2022-04-08 10:13:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions.
[2022-04-08 10:13:38,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 72 transitions.
[2022-04-08 10:13:38,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:38,226 INFO L225 Difference]: With dead ends: 182
[2022-04-08 10:13:38,226 INFO L226 Difference]: Without dead ends: 165
[2022-04-08 10:13:38,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=879, Invalid=4091, Unknown=0, NotChecked=0, Total=4970
[2022-04-08 10:13:38,227 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-04-08 10:13:38,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-04-08 10:13:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states.
[2022-04-08 10:13:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152.
[2022-04-08 10:13:38,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:13:38,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:38,396 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:38,396 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:38,398 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions.
[2022-04-08 10:13:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 205 transitions.
[2022-04-08 10:13:38,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:38,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:38,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states.
[2022-04-08 10:13:38,402 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states.
[2022-04-08 10:13:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:38,403 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions.
[2022-04-08 10:13:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 205 transitions.
[2022-04-08 10:13:38,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:38,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:38,403 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:13:38,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:13:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions.
[2022-04-08 10:13:38,405 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 43
[2022-04-08 10:13:38,405 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:13:38,405 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions.
[2022-04-08 10:13:38,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:38,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 192 transitions.
[2022-04-08 10:13:43,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 190 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions.
[2022-04-08 10:13:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-04-08 10:13:43,306 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:13:43,307 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:13:43,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0
[2022-04-08 10:13:43,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:43,507 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:13:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:13:43,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1247400145, now seen corresponding path program 137 times
[2022-04-08 10:13:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:43,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [906549528]
[2022-04-08 10:13:43,509 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:13:43,509 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:13:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1247400145, now seen corresponding path program 138 times
[2022-04-08 10:13:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:13:43,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677813674]
[2022-04-08 10:13:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:13:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:13:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:43,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:13:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:43,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {86209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86185#true} is VALID
[2022-04-08 10:13:43,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {86185#true} assume true; {86185#true} is VALID
[2022-04-08 10:13:43,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86185#true} {86185#true} #61#return; {86185#true} is VALID
[2022-04-08 10:13:43,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {86185#true} call ULTIMATE.init(); {86209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:13:43,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {86209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86185#true} is VALID
[2022-04-08 10:13:43,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {86185#true} assume true; {86185#true} is VALID
[2022-04-08 10:13:43,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86185#true} {86185#true} #61#return; {86185#true} is VALID
[2022-04-08 10:13:43,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {86185#true} call #t~ret11 := main(); {86185#true} is VALID
[2022-04-08 10:13:43,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {86185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86190#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:43,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {86190#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:43,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {86191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:43,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {86192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:43,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {86193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:43,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {86194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:43,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {86195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:43,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {86196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:43,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {86197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:43,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {86198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:43,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {86199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86200#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:43,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {86200#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86201#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:43,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {86201#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:43,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:43,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {86203#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:13:43,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {86203#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86204#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:13:43,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {86204#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86205#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:13:43,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {86205#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86206#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:13:43,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {86206#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86207#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:13:43,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {86207#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86208#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {86208#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:43,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {86186#false} assume !(~y~0 % 4294967296 > 0); {86186#false} is VALID
[2022-04-08 10:13:43,828 INFO L272 TraceCheckUtils]: 39: Hoare triple {86186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86186#false} is VALID
[2022-04-08 10:13:43,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {86186#false} ~cond := #in~cond; {86186#false} is VALID
[2022-04-08 10:13:43,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {86186#false} assume 0 == ~cond; {86186#false} is VALID
[2022-04-08 10:13:43,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {86186#false} assume !false; {86186#false} is VALID
[2022-04-08 10:13:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:13:43,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:13:43,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677813674]
[2022-04-08 10:13:43,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677813674] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:13:43,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370173736]
[2022-04-08 10:13:43,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:13:43,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:43,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:13:43,829 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:13:43,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process
[2022-04-08 10:13:44,313 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2022-04-08 10:13:44,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:13:44,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 39 conjunts are in the unsatisfiable core
[2022-04-08 10:13:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:44,325 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:13:44,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {86185#true} call ULTIMATE.init(); {86185#true} is VALID
[2022-04-08 10:13:44,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {86185#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86185#true} is VALID
[2022-04-08 10:13:44,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {86185#true} assume true; {86185#true} is VALID
[2022-04-08 10:13:44,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86185#true} {86185#true} #61#return; {86185#true} is VALID
[2022-04-08 10:13:44,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {86185#true} call #t~ret11 := main(); {86185#true} is VALID
[2022-04-08 10:13:44,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {86185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86190#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:44,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {86190#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:44,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {86191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:44,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {86192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:44,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {86193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:44,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {86194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:44,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {86195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:44,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {86196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:44,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {86197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:44,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {86198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:44,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {86199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86200#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:44,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {86200#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86201#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:44,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {86201#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:44,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:44,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {86203#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:13:44,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {86203#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86204#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:13:44,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {86204#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86205#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:13:44,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {86205#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86206#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:13:44,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {86206#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86207#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:13:44,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {86207#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86285#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:13:44,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {86285#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {86186#false} assume !(~y~0 % 4294967296 > 0); {86186#false} is VALID
[2022-04-08 10:13:44,619 INFO L272 TraceCheckUtils]: 39: Hoare triple {86186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86186#false} is VALID
[2022-04-08 10:13:44,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {86186#false} ~cond := #in~cond; {86186#false} is VALID
[2022-04-08 10:13:44,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {86186#false} assume 0 == ~cond; {86186#false} is VALID
[2022-04-08 10:13:44,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {86186#false} assume !false; {86186#false} is VALID
[2022-04-08 10:13:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:13:44,620 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:13:45,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {86186#false} assume !false; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {86186#false} assume 0 == ~cond; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {86186#false} ~cond := #in~cond; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L272 TraceCheckUtils]: 39: Hoare triple {86186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {86186#false} assume !(~y~0 % 4294967296 > 0); {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID
[2022-04-08 10:13:45,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {86391#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {86186#false} is VALID
[2022-04-08 10:13:45,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {86395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86391#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:13:45,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {86399#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:45,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {86403#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86399#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:13:45,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {86407#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86403#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:13:45,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {86411#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86407#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:13:45,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {86415#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {86411#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:13:45,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {86415#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {86415#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:45,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {86422#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86415#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:45,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {86426#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86422#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:45,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {86430#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86426#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:13:45,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {86434#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86430#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:13:45,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {86438#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86434#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:45,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {86442#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86438#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:13:45,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {86446#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86442#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:13:45,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {86450#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86446#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:13:45,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {86454#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86450#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:13:45,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {86458#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86454#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:13:45,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {86462#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86458#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:45,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {86466#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86462#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:13:45,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {86185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86466#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:45,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {86185#true} call #t~ret11 := main(); {86185#true} is VALID
[2022-04-08 10:13:45,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86185#true} {86185#true} #61#return; {86185#true} is VALID
[2022-04-08 10:13:45,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {86185#true} assume true; {86185#true} is VALID
[2022-04-08 10:13:45,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {86185#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86185#true} is VALID
[2022-04-08 10:13:45,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {86185#true} call ULTIMATE.init(); {86185#true} is VALID
[2022-04-08 10:13:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:13:45,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370173736] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:13:45,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:13:45,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42
[2022-04-08 10:13:45,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:13:45,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [906549528]
[2022-04-08 10:13:45,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [906549528] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:13:45,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:13:45,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2022-04-08 10:13:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271262640]
[2022-04-08 10:13:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:13:45,248 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:13:45,248 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:13:45,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:45,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:45,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2022-04-08 10:13:45,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:45,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2022-04-08 10:13:45,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722
[2022-04-08 10:13:45,269 INFO L87 Difference]: Start difference. First operand 152 states and 192 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:47,472 INFO L93 Difference]: Finished difference Result 185 states and 225 transitions.
[2022-04-08 10:13:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2022-04-08 10:13:47,473 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:13:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:13:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions.
[2022-04-08 10:13:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions.
[2022-04-08 10:13:47,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 78 transitions.
[2022-04-08 10:13:47,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:47,536 INFO L225 Difference]: With dead ends: 185
[2022-04-08 10:13:47,536 INFO L226 Difference]: Without dead ends: 167
[2022-04-08 10:13:47,536 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=906, Invalid=3924, Unknown=0, NotChecked=0, Total=4830
[2022-04-08 10:13:47,537 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-04-08 10:13:47,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-04-08 10:13:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states.
[2022-04-08 10:13:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153.
[2022-04-08 10:13:47,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:13:47,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:47,710 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:47,711 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:47,713 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions.
[2022-04-08 10:13:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions.
[2022-04-08 10:13:47,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:47,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:47,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states.
[2022-04-08 10:13:47,713 INFO L87 Difference]: Start difference. First operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states.
[2022-04-08 10:13:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:47,715 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions.
[2022-04-08 10:13:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions.
[2022-04-08 10:13:47,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:47,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:47,716 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:13:47,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:13:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 193 transitions.
[2022-04-08 10:13:47,717 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 193 transitions. Word has length 43
[2022-04-08 10:13:47,718 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:13:47,718 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 193 transitions.
[2022-04-08 10:13:47,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:47,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 193 transitions.
[2022-04-08 10:13:52,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 191 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 193 transitions.
[2022-04-08 10:13:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-04-08 10:13:52,549 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:13:52,550 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:13:52,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0
[2022-04-08 10:13:52,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:52,750 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:13:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:13:52,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1705851713, now seen corresponding path program 139 times
[2022-04-08 10:13:52,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:52,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2110860850]
[2022-04-08 10:13:52,752 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:13:52,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:13:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1705851713, now seen corresponding path program 140 times
[2022-04-08 10:13:52,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:13:52,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680213404]
[2022-04-08 10:13:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:13:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:13:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:13:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:53,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {87576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87553#true} is VALID
[2022-04-08 10:13:53,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {87553#true} assume true; {87553#true} is VALID
[2022-04-08 10:13:53,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87553#true} {87553#true} #61#return; {87553#true} is VALID
[2022-04-08 10:13:53,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {87553#true} call ULTIMATE.init(); {87576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:13:53,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {87576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87553#true} is VALID
[2022-04-08 10:13:53,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {87553#true} assume true; {87553#true} is VALID
[2022-04-08 10:13:53,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87553#true} {87553#true} #61#return; {87553#true} is VALID
[2022-04-08 10:13:53,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {87553#true} call #t~ret11 := main(); {87553#true} is VALID
[2022-04-08 10:13:53,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {87553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87558#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:53,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {87558#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87559#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:53,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {87559#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87560#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:53,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {87560#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87561#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:53,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {87561#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87562#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:53,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {87562#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87563#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:53,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {87563#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87564#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:53,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {87564#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87565#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:53,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {87565#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87566#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:53,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {87566#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87567#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:53,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {87567#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87568#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:53,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {87568#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87569#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:53,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {87569#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87570#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:53,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {87570#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:53,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:53,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {87572#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID
[2022-04-08 10:13:53,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {87572#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87573#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:13:53,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {87573#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87574#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:13:53,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {87574#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87575#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {87575#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {87554#false} assume !(~y~0 % 4294967296 > 0); {87554#false} is VALID
[2022-04-08 10:13:53,037 INFO L272 TraceCheckUtils]: 39: Hoare triple {87554#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87554#false} is VALID
[2022-04-08 10:13:53,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {87554#false} ~cond := #in~cond; {87554#false} is VALID
[2022-04-08 10:13:53,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {87554#false} assume 0 == ~cond; {87554#false} is VALID
[2022-04-08 10:13:53,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {87554#false} assume !false; {87554#false} is VALID
[2022-04-08 10:13:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2022-04-08 10:13:53,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:13:53,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680213404]
[2022-04-08 10:13:53,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680213404] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:13:53,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480905896]
[2022-04-08 10:13:53,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:13:53,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:53,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:13:53,038 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:13:53,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process
[2022-04-08 10:13:53,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:13:53,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:13:53,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjunts are in the unsatisfiable core
[2022-04-08 10:13:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:53,095 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:13:53,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {87553#true} call ULTIMATE.init(); {87553#true} is VALID
[2022-04-08 10:13:53,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {87553#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87553#true} is VALID
[2022-04-08 10:13:53,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {87553#true} assume true; {87553#true} is VALID
[2022-04-08 10:13:53,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87553#true} {87553#true} #61#return; {87553#true} is VALID
[2022-04-08 10:13:53,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {87553#true} call #t~ret11 := main(); {87553#true} is VALID
[2022-04-08 10:13:53,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {87553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87558#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:53,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {87558#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87559#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:53,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {87559#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87560#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:53,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {87560#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87561#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:53,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {87561#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87562#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:53,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {87562#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87563#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:53,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {87563#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87564#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:53,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {87564#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87565#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:53,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {87565#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87566#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:53,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {87566#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87567#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:53,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {87567#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87568#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:53,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {87568#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87569#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:53,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {87569#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87570#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:53,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {87570#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:53,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:53,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {87572#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID
[2022-04-08 10:13:53,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {87572#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87573#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:13:53,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {87573#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87574#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:13:53,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {87574#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87649#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {87649#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {87554#false} assume !(~y~0 % 4294967296 > 0); {87554#false} is VALID
[2022-04-08 10:13:53,387 INFO L272 TraceCheckUtils]: 39: Hoare triple {87554#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87554#false} is VALID
[2022-04-08 10:13:53,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {87554#false} ~cond := #in~cond; {87554#false} is VALID
[2022-04-08 10:13:53,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {87554#false} assume 0 == ~cond; {87554#false} is VALID
[2022-04-08 10:13:53,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {87554#false} assume !false; {87554#false} is VALID
[2022-04-08 10:13:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2022-04-08 10:13:53,387 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:13:53,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {87554#false} assume !false; {87554#false} is VALID
[2022-04-08 10:13:53,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {87554#false} assume 0 == ~cond; {87554#false} is VALID
[2022-04-08 10:13:53,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {87554#false} ~cond := #in~cond; {87554#false} is VALID
[2022-04-08 10:13:53,944 INFO L272 TraceCheckUtils]: 39: Hoare triple {87554#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87554#false} is VALID
[2022-04-08 10:13:53,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {87554#false} assume !(~y~0 % 4294967296 > 0); {87554#false} is VALID
[2022-04-08 10:13:53,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID
[2022-04-08 10:13:53,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {87761#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {87554#false} is VALID
[2022-04-08 10:13:53,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {87765#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87761#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:13:53,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {87769#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87765#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:53,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {87773#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87769#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:13:53,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {87777#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {87773#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:13:53,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {87777#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {87777#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:13:53,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {87784#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87777#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:13:53,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {87788#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87784#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:13:53,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {87792#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87788#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:53,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {87796#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87792#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:13:53,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {87800#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87796#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:13:53,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {87804#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87800#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:13:53,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {87808#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87804#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:13:53,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {87812#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87808#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:13:53,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {87816#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87812#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:53,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {87820#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87816#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:13:53,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {87824#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87820#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:53,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {87828#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87824#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:13:53,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {87832#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {87828#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:13:53,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {87553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87832#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:13:53,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {87553#true} call #t~ret11 := main(); {87553#true} is VALID
[2022-04-08 10:13:53,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87553#true} {87553#true} #61#return; {87553#true} is VALID
[2022-04-08 10:13:53,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {87553#true} assume true; {87553#true} is VALID
[2022-04-08 10:13:53,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {87553#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {87553#true} is VALID
[2022-04-08 10:13:53,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {87553#true} call ULTIMATE.init(); {87553#true} is VALID
[2022-04-08 10:13:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2022-04-08 10:13:53,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480905896] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:13:53,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:13:53,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40
[2022-04-08 10:13:53,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:13:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2110860850]
[2022-04-08 10:13:53,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2110860850] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:13:53,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:13:53,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2022-04-08 10:13:53,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740194777]
[2022-04-08 10:13:53,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:13:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:13:53,959 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:13:53,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:53,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:53,978 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2022-04-08 10:13:53,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:53,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2022-04-08 10:13:53,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560
[2022-04-08 10:13:53,979 INFO L87 Difference]: Start difference. First operand 153 states and 193 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:55,825 INFO L93 Difference]: Finished difference Result 188 states and 228 transitions.
[2022-04-08 10:13:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2022-04-08 10:13:55,825 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:13:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:13:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions.
[2022-04-08 10:13:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions.
[2022-04-08 10:13:55,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 79 transitions.
[2022-04-08 10:13:55,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:55,888 INFO L225 Difference]: With dead ends: 188
[2022-04-08 10:13:55,888 INFO L226 Difference]: Without dead ends: 169
[2022-04-08 10:13:55,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=793, Invalid=3239, Unknown=0, NotChecked=0, Total=4032
[2022-04-08 10:13:55,888 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-04-08 10:13:55,888 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 99 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-04-08 10:13:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2022-04-08 10:13:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154.
[2022-04-08 10:13:56,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:13:56,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:56,064 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:56,064 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:56,065 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions.
[2022-04-08 10:13:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions.
[2022-04-08 10:13:56,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:56,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:56,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states.
[2022-04-08 10:13:56,066 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states.
[2022-04-08 10:13:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:13:56,067 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions.
[2022-04-08 10:13:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions.
[2022-04-08 10:13:56,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:13:56,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:13:56,068 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:13:56,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:13:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 194 transitions.
[2022-04-08 10:13:56,069 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 194 transitions. Word has length 43
[2022-04-08 10:13:56,069 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:13:56,069 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 194 transitions.
[2022-04-08 10:13:56,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:56,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 194 transitions.
[2022-04-08 10:13:58,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 194 transitions.
[2022-04-08 10:13:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-04-08 10:13:58,648 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:13:58,648 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:13:58,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0
[2022-04-08 10:13:58,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98
[2022-04-08 10:13:58,849 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:13:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:13:58,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1126431377, now seen corresponding path program 141 times
[2022-04-08 10:13:58,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:58,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1419348382]
[2022-04-08 10:13:58,851 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:13:58,851 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:13:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1126431377, now seen corresponding path program 142 times
[2022-04-08 10:13:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:13:58,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841131056]
[2022-04-08 10:13:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:13:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:13:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:13:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:59,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {88945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {88923#true} is VALID
[2022-04-08 10:13:59,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {88923#true} assume true; {88923#true} is VALID
[2022-04-08 10:13:59,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88923#true} {88923#true} #61#return; {88923#true} is VALID
[2022-04-08 10:13:59,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {88923#true} call ULTIMATE.init(); {88945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:13:59,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {88945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {88923#true} is VALID
[2022-04-08 10:13:59,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {88923#true} assume true; {88923#true} is VALID
[2022-04-08 10:13:59,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88923#true} {88923#true} #61#return; {88923#true} is VALID
[2022-04-08 10:13:59,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {88923#true} call #t~ret11 := main(); {88923#true} is VALID
[2022-04-08 10:13:59,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {88923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {88928#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:59,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {88928#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:59,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {88929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:59,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {88930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:59,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {88931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:59,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {88932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:59,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {88933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:59,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {88934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:59,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {88935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:59,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {88936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:59,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {88937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:59,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {88938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:59,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {88939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:59,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {88940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:59,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {88941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:13:59,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:13:59,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {88943#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID
[2022-04-08 10:13:59,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {88943#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {88944#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {88944#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {88924#false} assume !(~y~0 % 4294967296 > 0); {88924#false} is VALID
[2022-04-08 10:13:59,119 INFO L272 TraceCheckUtils]: 39: Hoare triple {88924#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {88924#false} is VALID
[2022-04-08 10:13:59,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {88924#false} ~cond := #in~cond; {88924#false} is VALID
[2022-04-08 10:13:59,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {88924#false} assume 0 == ~cond; {88924#false} is VALID
[2022-04-08 10:13:59,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {88924#false} assume !false; {88924#false} is VALID
[2022-04-08 10:13:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2022-04-08 10:13:59,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:13:59,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841131056]
[2022-04-08 10:13:59,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841131056] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:13:59,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663693369]
[2022-04-08 10:13:59,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:13:59,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:13:59,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:13:59,120 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:13:59,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process
[2022-04-08 10:13:59,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:13:59,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:13:59,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 35 conjunts are in the unsatisfiable core
[2022-04-08 10:13:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:13:59,175 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:13:59,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {88923#true} call ULTIMATE.init(); {88923#true} is VALID
[2022-04-08 10:13:59,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {88923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {88923#true} is VALID
[2022-04-08 10:13:59,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {88923#true} assume true; {88923#true} is VALID
[2022-04-08 10:13:59,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88923#true} {88923#true} #61#return; {88923#true} is VALID
[2022-04-08 10:13:59,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {88923#true} call #t~ret11 := main(); {88923#true} is VALID
[2022-04-08 10:13:59,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {88923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {88928#(= main_~y~0 0)} is VALID
[2022-04-08 10:13:59,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {88928#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:13:59,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {88929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:13:59,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {88930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:13:59,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {88931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:13:59,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {88932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:13:59,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {88933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:13:59,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {88934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:13:59,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {88935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:13:59,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {88936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:13:59,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {88937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:13:59,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {88938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:13:59,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {88939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:13:59,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {88940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:13:59,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {88941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:13:59,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:13:59,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {88943#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID
[2022-04-08 10:13:59,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {88943#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89015#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID
[2022-04-08 10:13:59,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {89015#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {88924#false} is VALID
[2022-04-08 10:13:59,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {88924#false} assume !(~y~0 % 4294967296 > 0); {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L272 TraceCheckUtils]: 39: Hoare triple {88924#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {88924#false} ~cond := #in~cond; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {88924#false} assume 0 == ~cond; {88924#false} is VALID
[2022-04-08 10:13:59,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {88924#false} assume !false; {88924#false} is VALID
[2022-04-08 10:13:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2022-04-08 10:13:59,445 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:13:59,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {88924#false} assume !false; {88924#false} is VALID
[2022-04-08 10:13:59,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {88924#false} assume 0 == ~cond; {88924#false} is VALID
[2022-04-08 10:13:59,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {88924#false} ~cond := #in~cond; {88924#false} is VALID
[2022-04-08 10:13:59,964 INFO L272 TraceCheckUtils]: 39: Hoare triple {88924#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {88924#false} is VALID
[2022-04-08 10:13:59,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {88924#false} assume !(~y~0 % 4294967296 > 0); {88924#false} is VALID
[2022-04-08 10:13:59,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID
[2022-04-08 10:13:59,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {89133#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {88924#false} is VALID
[2022-04-08 10:13:59,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {89137#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89133#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:13:59,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {89141#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {89137#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:59,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {89141#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {89141#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:59,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {89148#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89141#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:13:59,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {89152#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89148#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:13:59,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {89156#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89152#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:13:59,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {89160#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89156#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:13:59,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {89164#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89160#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:13:59,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {89168#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89164#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:13:59,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {89172#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89168#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:59,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {89176#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89172#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:13:59,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {89180#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89176#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:13:59,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {89184#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89180#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:13:59,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {89188#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89184#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:13:59,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {89192#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89188#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:13:59,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {89196#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89192#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:13:59,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {89200#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89196#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:13:59,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {88923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89200#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:13:59,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {88923#true} call #t~ret11 := main(); {88923#true} is VALID
[2022-04-08 10:13:59,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88923#true} {88923#true} #61#return; {88923#true} is VALID
[2022-04-08 10:13:59,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {88923#true} assume true; {88923#true} is VALID
[2022-04-08 10:13:59,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {88923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {88923#true} is VALID
[2022-04-08 10:13:59,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {88923#true} call ULTIMATE.init(); {88923#true} is VALID
[2022-04-08 10:13:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2022-04-08 10:13:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663693369] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:13:59,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:13:59,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38
[2022-04-08 10:13:59,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:13:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1419348382]
[2022-04-08 10:13:59,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1419348382] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:13:59,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:13:59,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2022-04-08 10:13:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043868945]
[2022-04-08 10:13:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:13:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:13:59,978 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:13:59,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:13:59,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:13:59,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2022-04-08 10:13:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:13:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2022-04-08 10:13:59,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406
[2022-04-08 10:13:59,998 INFO L87 Difference]: Start difference. First operand 154 states and 194 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:14:01,834 INFO L93 Difference]: Finished difference Result 191 states and 231 transitions.
[2022-04-08 10:14:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2022-04-08 10:14:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:14:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:14:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions.
[2022-04-08 10:14:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions.
[2022-04-08 10:14:01,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 78 transitions.
[2022-04-08 10:14:01,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:14:01,898 INFO L225 Difference]: With dead ends: 191
[2022-04-08 10:14:01,898 INFO L226 Difference]: Without dead ends: 171
[2022-04-08 10:14:01,899 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=658, Invalid=2422, Unknown=0, NotChecked=0, Total=3080
[2022-04-08 10:14:01,899 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-04-08 10:14:01,899 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 112 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-04-08 10:14:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2022-04-08 10:14:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155.
[2022-04-08 10:14:02,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:14:02,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:02,075 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:02,075 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:14:02,076 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions.
[2022-04-08 10:14:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions.
[2022-04-08 10:14:02,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:14:02,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:14:02,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 171 states.
[2022-04-08 10:14:02,077 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 171 states.
[2022-04-08 10:14:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:14:02,078 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions.
[2022-04-08 10:14:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions.
[2022-04-08 10:14:02,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:14:02,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:14:02,079 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:14:02,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:14:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 195 transitions.
[2022-04-08 10:14:02,080 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 195 transitions. Word has length 43
[2022-04-08 10:14:02,080 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:14:02,080 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 195 transitions.
[2022-04-08 10:14:02,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:02,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 195 transitions.
[2022-04-08 10:14:03,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:14:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 195 transitions.
[2022-04-08 10:14:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-04-08 10:14:03,374 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:14:03,374 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:14:03,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0
[2022-04-08 10:14:03,574 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:14:03,574 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:14:03,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:14:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash -31803666, now seen corresponding path program 57 times
[2022-04-08 10:14:03,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:14:03,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427971588]
[2022-04-08 10:14:03,577 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:14:03,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:14:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash -31803666, now seen corresponding path program 58 times
[2022-04-08 10:14:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:14:03,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330858641]
[2022-04-08 10:14:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:14:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:14:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:14:04,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:14:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:14:04,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {90327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90291#true} is VALID
[2022-04-08 10:14:04,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {90291#true} assume true; {90291#true} is VALID
[2022-04-08 10:14:04,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90291#true} {90291#true} #61#return; {90291#true} is VALID
[2022-04-08 10:14:04,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {90291#true} call ULTIMATE.init(); {90327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:14:04,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {90327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90291#true} is VALID
[2022-04-08 10:14:04,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {90291#true} assume true; {90291#true} is VALID
[2022-04-08 10:14:04,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90291#true} {90291#true} #61#return; {90291#true} is VALID
[2022-04-08 10:14:04,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {90291#true} call #t~ret11 := main(); {90291#true} is VALID
[2022-04-08 10:14:04,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {90291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90296#(= main_~y~0 0)} is VALID
[2022-04-08 10:14:04,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {90296#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:14:04,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {90297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:14:04,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {90298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:14:04,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {90299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:14:04,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {90300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:14:04,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {90301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:14:04,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {90302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:14:04,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {90303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:14:04,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {90304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:14:04,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {90305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:14:04,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {90306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:14:04,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {90307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90308#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:14:04,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {90308#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90309#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:14:04,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {90309#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90310#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:14:04,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {90310#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90311#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:14:04,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {90311#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90312#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:14:04,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {90312#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90313#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:14:04,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {90313#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90314#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:14:04,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {90314#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90315#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:14:04,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {90315#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90316#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:14:04,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {90316#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90317#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:14:04,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {90317#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90318#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:14:04,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {90318#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90319#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:14:04,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {90319#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90320#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:14:04,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {90320#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90321#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:14:04,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {90321#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90322#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:14:04,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {90322#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90323#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID
[2022-04-08 10:14:04,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {90323#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90324#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID
[2022-04-08 10:14:04,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {90324#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID
[2022-04-08 10:14:04,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID
[2022-04-08 10:14:04,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {90326#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} is VALID
[2022-04-08 10:14:04,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {90326#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90292#false} is VALID
[2022-04-08 10:14:04,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {90292#false} assume !(~y~0 % 4294967296 > 0); {90292#false} is VALID
[2022-04-08 10:14:04,201 INFO L272 TraceCheckUtils]: 39: Hoare triple {90292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90292#false} is VALID
[2022-04-08 10:14:04,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {90292#false} ~cond := #in~cond; {90292#false} is VALID
[2022-04-08 10:14:04,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {90292#false} assume 0 == ~cond; {90292#false} is VALID
[2022-04-08 10:14:04,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {90292#false} assume !false; {90292#false} is VALID
[2022-04-08 10:14:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:14:04,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:14:04,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330858641]
[2022-04-08 10:14:04,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330858641] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:14:04,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477341611]
[2022-04-08 10:14:04,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:14:04,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:14:04,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:14:04,202 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:14:04,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process
[2022-04-08 10:14:04,248 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:14:04,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:14:04,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 63 conjunts are in the unsatisfiable core
[2022-04-08 10:14:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:14:04,260 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:14:04,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {90291#true} call ULTIMATE.init(); {90291#true} is VALID
[2022-04-08 10:14:04,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {90291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90291#true} is VALID
[2022-04-08 10:14:04,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {90291#true} assume true; {90291#true} is VALID
[2022-04-08 10:14:04,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90291#true} {90291#true} #61#return; {90291#true} is VALID
[2022-04-08 10:14:04,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {90291#true} call #t~ret11 := main(); {90291#true} is VALID
[2022-04-08 10:14:04,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {90291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90296#(= main_~y~0 0)} is VALID
[2022-04-08 10:14:04,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {90296#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:14:04,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {90297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:14:04,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {90298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:14:04,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {90299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:14:04,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {90300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:14:04,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {90301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:14:04,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {90302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:14:04,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {90303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:14:04,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {90304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:14:04,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {90305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:14:04,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {90306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:14:04,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {90307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90308#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:14:04,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {90308#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90309#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID
[2022-04-08 10:14:04,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {90309#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90310#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID
[2022-04-08 10:14:04,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {90310#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90311#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID
[2022-04-08 10:14:04,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {90311#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90312#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID
[2022-04-08 10:14:04,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {90312#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90313#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID
[2022-04-08 10:14:04,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {90313#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90314#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID
[2022-04-08 10:14:04,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {90314#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90315#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID
[2022-04-08 10:14:04,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {90315#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90316#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID
[2022-04-08 10:14:04,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {90316#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90317#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID
[2022-04-08 10:14:04,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {90317#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90318#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID
[2022-04-08 10:14:04,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {90318#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90319#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID
[2022-04-08 10:14:04,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {90319#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90320#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID
[2022-04-08 10:14:04,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {90320#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90321#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID
[2022-04-08 10:14:04,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {90321#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90322#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID
[2022-04-08 10:14:04,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {90322#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90323#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID
[2022-04-08 10:14:04,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {90323#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90324#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID
[2022-04-08 10:14:04,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {90324#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID
[2022-04-08 10:14:04,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID
[2022-04-08 10:14:04,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {90439#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID
[2022-04-08 10:14:04,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {90439#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90292#false} is VALID
[2022-04-08 10:14:04,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {90292#false} assume !(~y~0 % 4294967296 > 0); {90292#false} is VALID
[2022-04-08 10:14:04,663 INFO L272 TraceCheckUtils]: 39: Hoare triple {90292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90292#false} is VALID
[2022-04-08 10:14:04,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {90292#false} ~cond := #in~cond; {90292#false} is VALID
[2022-04-08 10:14:04,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {90292#false} assume 0 == ~cond; {90292#false} is VALID
[2022-04-08 10:14:04,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {90292#false} assume !false; {90292#false} is VALID
[2022-04-08 10:14:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:14:04,663 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:14:06,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {90292#false} assume !false; {90292#false} is VALID
[2022-04-08 10:14:06,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {90292#false} assume 0 == ~cond; {90292#false} is VALID
[2022-04-08 10:14:06,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {90292#false} ~cond := #in~cond; {90292#false} is VALID
[2022-04-08 10:14:06,161 INFO L272 TraceCheckUtils]: 39: Hoare triple {90292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90292#false} is VALID
[2022-04-08 10:14:06,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {90292#false} assume !(~y~0 % 4294967296 > 0); {90292#false} is VALID
[2022-04-08 10:14:06,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {90473#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {90292#false} is VALID
[2022-04-08 10:14:06,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {90477#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {90473#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:14:06,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {90477#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {90477#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:14:06,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {90484#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90477#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:14:06,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {90488#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90484#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:14:06,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {90492#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90488#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:14:06,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {90496#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90492#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:14:06,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {90500#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90496#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:14:06,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {90504#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90500#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:14:06,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {90508#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90504#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:14:06,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {90512#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90508#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:14:06,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {90516#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90512#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID
[2022-04-08 10:14:06,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {90520#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90516#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID
[2022-04-08 10:14:06,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {90524#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90520#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID
[2022-04-08 10:14:06,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {90528#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90524#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID
[2022-04-08 10:14:06,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {90532#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90528#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID
[2022-04-08 10:14:06,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {90536#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90532#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID
[2022-04-08 10:14:06,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {90540#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90536#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID
[2022-04-08 10:14:06,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {90544#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90540#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID
[2022-04-08 10:14:06,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {90548#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90544#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID
[2022-04-08 10:14:06,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {90552#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90548#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID
[2022-04-08 10:14:06,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {90556#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90552#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID
[2022-04-08 10:14:06,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {90560#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90556#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:14:06,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {90564#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90560#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID
[2022-04-08 10:14:06,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {90568#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90564#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID
[2022-04-08 10:14:06,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {90572#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90568#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID
[2022-04-08 10:14:06,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {90576#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90572#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:14:06,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {90580#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90576#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID
[2022-04-08 10:14:06,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {90584#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90580#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID
[2022-04-08 10:14:06,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {90588#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90584#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID
[2022-04-08 10:14:06,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {90592#(< 0 (mod (+ main_~y~0 28) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90588#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID
[2022-04-08 10:14:06,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {90596#(< 0 (mod (+ 29 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {90592#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID
[2022-04-08 10:14:06,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {90291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90596#(< 0 (mod (+ 29 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:14:06,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {90291#true} call #t~ret11 := main(); {90291#true} is VALID
[2022-04-08 10:14:06,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90291#true} {90291#true} #61#return; {90291#true} is VALID
[2022-04-08 10:14:06,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {90291#true} assume true; {90291#true} is VALID
[2022-04-08 10:14:06,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {90291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {90291#true} is VALID
[2022-04-08 10:14:06,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {90291#true} call ULTIMATE.init(); {90291#true} is VALID
[2022-04-08 10:14:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:14:06,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477341611] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:14:06,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:14:06,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66
[2022-04-08 10:14:06,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:14:06,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427971588]
[2022-04-08 10:14:06,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427971588] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:14:06,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:14:06,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34
[2022-04-08 10:14:06,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734990724]
[2022-04-08 10:14:06,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:14:06,183 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:14:06,183 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:14:06,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:06,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:14:06,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2022-04-08 10:14:06,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:14:06,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2022-04-08 10:14:06,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1031, Invalid=3259, Unknown=0, NotChecked=0, Total=4290
[2022-04-08 10:14:06,207 INFO L87 Difference]: Start difference. First operand 155 states and 195 transitions. Second operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:14:13,148 INFO L93 Difference]: Finished difference Result 196 states and 269 transitions.
[2022-04-08 10:14:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2022-04-08 10:14:13,149 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43
[2022-04-08 10:14:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:14:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 196 transitions.
[2022-04-08 10:14:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 196 transitions.
[2022-04-08 10:14:13,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 196 transitions.
[2022-04-08 10:14:13,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:14:13,306 INFO L225 Difference]: With dead ends: 196
[2022-04-08 10:14:13,306 INFO L226 Difference]: Without dead ends: 190
[2022-04-08 10:14:13,306 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2087, Invalid=7225, Unknown=0, NotChecked=0, Total=9312
[2022-04-08 10:14:13,307 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 172 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4437 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 4560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2022-04-08 10:14:13,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 226 Invalid, 4560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4437 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2022-04-08 10:14:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states.
[2022-04-08 10:14:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160.
[2022-04-08 10:14:13,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:14:13,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:13,487 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:13,488 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:14:13,489 INFO L93 Difference]: Finished difference Result 190 states and 232 transitions.
[2022-04-08 10:14:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions.
[2022-04-08 10:14:13,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:14:13,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:14:13,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 190 states.
[2022-04-08 10:14:13,490 INFO L87 Difference]: Start difference. First operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 190 states.
[2022-04-08 10:14:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:14:13,491 INFO L93 Difference]: Finished difference Result 190 states and 232 transitions.
[2022-04-08 10:14:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions.
[2022-04-08 10:14:13,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:14:13,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:14:13,492 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:14:13,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:14:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions.
[2022-04-08 10:14:13,493 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 43
[2022-04-08 10:14:13,493 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:14:13,493 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions.
[2022-04-08 10:14:13,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:13,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions.
[2022-04-08 10:14:15,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:14:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions.
[2022-04-08 10:14:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2022-04-08 10:14:15,299 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:14:15,300 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:14:15,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0
[2022-04-08 10:14:15,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:14:15,500 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:14:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:14:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 143 times
[2022-04-08 10:14:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:14:15,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1554389415]
[2022-04-08 10:14:15,502 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:14:15,503 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:14:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 144 times
[2022-04-08 10:14:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:14:15,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374854709]
[2022-04-08 10:14:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:14:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:14:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:14:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:14:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:14:16,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {91802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91771#true} is VALID
[2022-04-08 10:14:16,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {91771#true} assume true; {91771#true} is VALID
[2022-04-08 10:14:16,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91771#true} {91771#true} #61#return; {91771#true} is VALID
[2022-04-08 10:14:16,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {91771#true} call ULTIMATE.init(); {91802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:14:16,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {91802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91771#true} is VALID
[2022-04-08 10:14:16,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {91771#true} assume true; {91771#true} is VALID
[2022-04-08 10:14:16,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91771#true} {91771#true} #61#return; {91771#true} is VALID
[2022-04-08 10:14:16,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {91771#true} call #t~ret11 := main(); {91771#true} is VALID
[2022-04-08 10:14:16,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {91771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91776#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:14:16,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {91776#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91777#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:14:16,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {91777#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91778#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:14:16,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {91778#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91779#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:16,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {91779#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91780#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:14:16,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {91780#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91781#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:16,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {91781#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91782#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID
[2022-04-08 10:14:16,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {91782#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91783#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:14:16,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {91783#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91784#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967287)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:14:16,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {91784#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967287)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91785#(and (<= main_~x~0 (+ 4294967286 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:14:16,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {91785#(and (<= main_~x~0 (+ 4294967286 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91786#(and (<= main_~y~0 10) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 10) main_~n~0) (<= 10 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID
[2022-04-08 10:14:16,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {91786#(and (<= main_~y~0 10) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 10) main_~n~0) (<= 10 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {91787#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~y~0 10))} is VALID
[2022-04-08 10:14:16,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {91787#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~y~0 10))} ~z~0 := ~y~0; {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:16,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:14:16,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} is VALID
[2022-04-08 10:14:16,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:16,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:16,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:16,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:16,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:14:16,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:14:16,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:16,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:16,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:16,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:16,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:14:16,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:14:16,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:16,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:16,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:16,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:16,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} is VALID
[2022-04-08 10:14:16,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:14:16,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:16,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:16,637 INFO L272 TraceCheckUtils]: 40: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 10:14:16,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {91800#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {91801#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 10:14:16,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {91801#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {91772#false} is VALID
[2022-04-08 10:14:16,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {91772#false} assume !false; {91772#false} is VALID
[2022-04-08 10:14:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:14:16,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:14:16,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374854709]
[2022-04-08 10:14:16,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374854709] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:14:16,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626154457]
[2022-04-08 10:14:16,639 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 10:14:16,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:14:16,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:14:16,640 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:14:16,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process
[2022-04-08 10:14:17,119 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s)
[2022-04-08 10:14:17,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:14:17,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 93 conjunts are in the unsatisfiable core
[2022-04-08 10:14:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:14:17,172 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:14:42,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {91771#true} call ULTIMATE.init(); {91771#true} is VALID
[2022-04-08 10:14:42,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {91771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91771#true} is VALID
[2022-04-08 10:14:42,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {91771#true} assume true; {91771#true} is VALID
[2022-04-08 10:14:42,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91771#true} {91771#true} #61#return; {91771#true} is VALID
[2022-04-08 10:14:42,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {91771#true} call #t~ret11 := main(); {91771#true} is VALID
[2022-04-08 10:14:42,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {91771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91776#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID
[2022-04-08 10:14:42,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {91776#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91777#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:14:42,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {91777#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91778#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID
[2022-04-08 10:14:42,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {91778#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91779#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:42,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {91779#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91833#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:42,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {91833#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91837#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} is VALID
[2022-04-08 10:14:42,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {91837#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91841#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID
[2022-04-08 10:14:42,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {91841#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91845#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 7))} is VALID
[2022-04-08 10:14:42,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {91845#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91849#(and (<= (+ main_~x~0 8) main_~n~0) (<= main_~y~0 8) (<= main_~x~0 (+ 4294967287 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:42,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {91849#(and (<= (+ main_~x~0 8) main_~n~0) (<= main_~y~0 8) (<= main_~x~0 (+ 4294967287 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91853#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967286)) (<= main_~y~0 9))} is VALID
[2022-04-08 10:14:42,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {91853#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967286)) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91857#(and (<= main_~x~0 (+ 4294967285 (* (div (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 10) (<= (+ main_~x~0 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {91857#(and (<= main_~x~0 (+ 4294967285 (* (div (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 10) (<= (+ main_~x~0 10) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {91787#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~y~0 10))} is VALID
[2022-04-08 10:14:42,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {91787#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~y~0 10))} ~z~0 := ~y~0; {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:14:42,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:42,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:14:42,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:14:42,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:42,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:42,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:42,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:42,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} is VALID
[2022-04-08 10:14:42,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} is VALID
[2022-04-08 10:14:42,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID
[2022-04-08 10:14:42,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:14:42,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} is VALID
[2022-04-08 10:14:42,405 INFO L272 TraceCheckUtils]: 40: Hoare triple {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:14:42,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {91933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {91937#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:14:42,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {91937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {91772#false} is VALID
[2022-04-08 10:14:42,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {91772#false} assume !false; {91772#false} is VALID
[2022-04-08 10:14:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:14:42,406 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:14:53,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {91772#false} assume !false; {91772#false} is VALID
[2022-04-08 10:14:53,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {91937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {91772#false} is VALID
[2022-04-08 10:14:53,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {91933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {91937#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:14:53,638 INFO L272 TraceCheckUtils]: 40: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:14:53,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {91959#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {91963#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91959#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {91967#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91963#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:14:53,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {91971#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91967#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {91975#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91971#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:14:53,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {91979#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91975#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {91983#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91979#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:14:53,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {91987#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91983#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {91991#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91987#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {91995#(and (< (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 11)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91991#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} is VALID
[2022-04-08 10:14:53,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {91995#(and (< (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 11)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {91995#(and (< (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 11)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {91991#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91995#(and (< (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 11)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {91987#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91991#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} is VALID
[2022-04-08 10:14:53,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {91983#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91987#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {91979#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91983#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {91975#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91979#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:14:53,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {91971#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91975#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {91967#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91971#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:14:53,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {91963#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91967#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {91959#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91963#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:14:53,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91959#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {92032#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 10:14:53,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {92036#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {92032#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID
[2022-04-08 10:14:53,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {92040#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92036#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID
[2022-04-08 10:14:53,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {92044#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92040#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:14:53,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {92048#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92044#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:14:53,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {92052#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92048#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:14:53,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {92056#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92052#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:14:53,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {92060#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92056#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:14:53,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {92064#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92060#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID
[2022-04-08 10:14:53,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {92068#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92064#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:14:53,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {92072#(or (and (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10)) (<= (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967287) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92068#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID
[2022-04-08 10:14:53,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {92076#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 11))) (< 0 (mod (+ main_~x~0 4294967286) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92072#(or (and (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10)) (<= (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967287) 4294967296)))} is VALID
[2022-04-08 10:14:53,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {91771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92076#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 11))) (< 0 (mod (+ main_~x~0 4294967286) 4294967296)))} is VALID
[2022-04-08 10:14:53,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {91771#true} call #t~ret11 := main(); {91771#true} is VALID
[2022-04-08 10:14:53,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91771#true} {91771#true} #61#return; {91771#true} is VALID
[2022-04-08 10:14:53,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {91771#true} assume true; {91771#true} is VALID
[2022-04-08 10:14:53,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {91771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91771#true} is VALID
[2022-04-08 10:14:53,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {91771#true} call ULTIMATE.init(); {91771#true} is VALID
[2022-04-08 10:14:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:14:53,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626154457] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:14:53,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:14:53,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 60
[2022-04-08 10:14:53,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:14:53,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1554389415]
[2022-04-08 10:14:53,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1554389415] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:14:53,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:14:53,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29
[2022-04-08 10:14:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386705152]
[2022-04-08 10:14:53,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:14:53,673 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44
[2022-04-08 10:14:53,673 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:14:53,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:53,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:14:53,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2022-04-08 10:14:53,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:14:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2022-04-08 10:14:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=3212, Unknown=1, NotChecked=0, Total=3540
[2022-04-08 10:14:53,881 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:14:59,069 INFO L93 Difference]: Finished difference Result 191 states and 233 transitions.
[2022-04-08 10:14:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states.
[2022-04-08 10:14:59,070 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44
[2022-04-08 10:14:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:14:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions.
[2022-04-08 10:14:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions.
[2022-04-08 10:14:59,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 64 transitions.
[2022-04-08 10:14:59,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:14:59,402 INFO L225 Difference]: With dead ends: 191
[2022-04-08 10:14:59,402 INFO L226 Difference]: Without dead ends: 148
[2022-04-08 10:14:59,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=687, Invalid=8242, Unknown=1, NotChecked=0, Total=8930
[2022-04-08 10:14:59,403 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-04-08 10:14:59,403 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 134 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-04-08 10:14:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2022-04-08 10:14:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148.
[2022-04-08 10:14:59,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:14:59,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:59,564 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:59,564 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:14:59,566 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions.
[2022-04-08 10:14:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions.
[2022-04-08 10:14:59,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:14:59,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:14:59,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 148 states.
[2022-04-08 10:14:59,566 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 148 states.
[2022-04-08 10:14:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:14:59,567 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions.
[2022-04-08 10:14:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions.
[2022-04-08 10:14:59,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:14:59,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:14:59,568 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:14:59,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:14:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 188 transitions.
[2022-04-08 10:14:59,569 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 188 transitions. Word has length 44
[2022-04-08 10:14:59,569 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:14:59,569 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 188 transitions.
[2022-04-08 10:14:59,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:14:59,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 188 transitions.
[2022-04-08 10:15:03,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:15:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions.
[2022-04-08 10:15:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2022-04-08 10:15:03,273 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:15:03,273 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:15:03,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0
[2022-04-08 10:15:03,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101
[2022-04-08 10:15:03,473 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:15:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:15:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1338400127, now seen corresponding path program 145 times
[2022-04-08 10:15:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:15:03,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778117516]
[2022-04-08 10:15:03,475 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:15:03,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:15:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1338400127, now seen corresponding path program 146 times
[2022-04-08 10:15:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:15:03,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73227643]
[2022-04-08 10:15:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:15:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:15:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:15:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:15:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:15:03,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {93167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {93141#true} is VALID
[2022-04-08 10:15:03,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {93141#true} assume true; {93141#true} is VALID
[2022-04-08 10:15:03,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93141#true} {93141#true} #61#return; {93141#true} is VALID
[2022-04-08 10:15:03,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {93141#true} call ULTIMATE.init(); {93167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:15:03,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {93167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {93141#true} is VALID
[2022-04-08 10:15:03,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {93141#true} assume true; {93141#true} is VALID
[2022-04-08 10:15:03,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93141#true} {93141#true} #61#return; {93141#true} is VALID
[2022-04-08 10:15:03,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {93141#true} call #t~ret11 := main(); {93141#true} is VALID
[2022-04-08 10:15:03,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {93141#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93146#(= main_~y~0 0)} is VALID
[2022-04-08 10:15:03,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {93146#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93147#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:15:03,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {93147#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93148#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:15:03,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {93148#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93149#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:15:03,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {93149#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93150#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:15:03,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {93150#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93151#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:15:03,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {93151#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93152#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:15:03,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {93152#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93153#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:15:03,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {93153#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93154#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:15:03,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {93154#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93155#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:15:03,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {93155#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93156#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:15:03,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {93156#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:03,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {93157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {93157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:03,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {93157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {93158#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:15:03,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {93158#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93159#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:15:03,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {93159#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93160#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:15:03,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {93160#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93161#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:15:03,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {93161#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93162#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:15:03,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {93162#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93163#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:15:03,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {93163#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93164#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID
[2022-04-08 10:15:03,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {93164#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93165#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID
[2022-04-08 10:15:03,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {93165#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93166#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {93166#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {93142#false} assume !(~y~0 % 4294967296 > 0); {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L272 TraceCheckUtils]: 40: Hoare triple {93142#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {93142#false} ~cond := #in~cond; {93142#false} is VALID
[2022-04-08 10:15:03,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {93142#false} assume 0 == ~cond; {93142#false} is VALID
[2022-04-08 10:15:03,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {93142#false} assume !false; {93142#false} is VALID
[2022-04-08 10:15:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:15:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:15:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73227643]
[2022-04-08 10:15:03,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73227643] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:15:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359196006]
[2022-04-08 10:15:03,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:15:03,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:15:03,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:15:03,838 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:15:03,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process
[2022-04-08 10:15:03,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:15:03,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:15:03,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 60 conjunts are in the unsatisfiable core
[2022-04-08 10:15:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:15:03,897 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:15:04,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {93141#true} call ULTIMATE.init(); {93141#true} is VALID
[2022-04-08 10:15:04,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {93141#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {93141#true} is VALID
[2022-04-08 10:15:04,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {93141#true} assume true; {93141#true} is VALID
[2022-04-08 10:15:04,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93141#true} {93141#true} #61#return; {93141#true} is VALID
[2022-04-08 10:15:04,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {93141#true} call #t~ret11 := main(); {93141#true} is VALID
[2022-04-08 10:15:04,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {93141#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93146#(= main_~y~0 0)} is VALID
[2022-04-08 10:15:04,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {93146#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93147#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:15:04,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {93147#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93148#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:15:04,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {93148#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93149#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:15:04,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {93149#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93150#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:15:04,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {93150#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93151#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:15:04,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {93151#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93152#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:15:04,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {93152#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93153#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:15:04,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {93153#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93154#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:15:04,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {93154#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93155#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:15:04,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {93155#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93156#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:15:04,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {93156#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:04,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {93157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {93157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:04,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {93157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {93225#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:04,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {93225#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93229#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:15:04,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {93229#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93233#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:04,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {93233#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93237#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:04,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {93237#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93241#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID
[2022-04-08 10:15:04,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {93241#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93245#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:04,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {93245#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93249#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:04,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {93249#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93253#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:04,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {93253#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93257#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {93257#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:04,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {93142#false} assume !(~y~0 % 4294967296 > 0); {93142#false} is VALID
[2022-04-08 10:15:04,334 INFO L272 TraceCheckUtils]: 40: Hoare triple {93142#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {93142#false} is VALID
[2022-04-08 10:15:04,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {93142#false} ~cond := #in~cond; {93142#false} is VALID
[2022-04-08 10:15:04,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {93142#false} assume 0 == ~cond; {93142#false} is VALID
[2022-04-08 10:15:04,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {93142#false} assume !false; {93142#false} is VALID
[2022-04-08 10:15:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2022-04-08 10:15:04,334 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:15:05,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {93142#false} assume !false; {93142#false} is VALID
[2022-04-08 10:15:05,032 INFO L290 TraceCheckUtils]: 42: Hoare triple {93142#false} assume 0 == ~cond; {93142#false} is VALID
[2022-04-08 10:15:05,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {93142#false} ~cond := #in~cond; {93142#false} is VALID
[2022-04-08 10:15:05,032 INFO L272 TraceCheckUtils]: 40: Hoare triple {93142#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {93142#false} is VALID
[2022-04-08 10:15:05,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {93142#false} assume !(~y~0 % 4294967296 > 0); {93142#false} is VALID
[2022-04-08 10:15:05,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:05,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {93142#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:05,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {93330#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93142#false} is VALID
[2022-04-08 10:15:05,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {93334#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93330#(not (< 0 (mod main_~y~0 4294967296)))} is VALID
[2022-04-08 10:15:05,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {93338#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93334#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:15:05,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {93342#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93338#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID
[2022-04-08 10:15:05,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {93346#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93342#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:15:05,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {93350#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93346#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:15:05,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {93354#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93350#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:15:05,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {93358#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93354#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:15:05,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {93362#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93358#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:15:05,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {93366#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {93362#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID
[2022-04-08 10:15:05,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {93370#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93366#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID
[2022-04-08 10:15:05,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {93374#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93370#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID
[2022-04-08 10:15:05,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {93378#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93374#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID
[2022-04-08 10:15:05,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {93382#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93378#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID
[2022-04-08 10:15:05,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {93386#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93382#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:15:05,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {93390#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93386#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:15:05,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {93394#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93390#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {93398#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93394#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {93141#true} ~z~0 := ~y~0; {93398#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {93141#true} assume !(~x~0 % 4294967296 > 0); {93141#true} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {93141#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {93141#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {93141#true} call #t~ret11 := main(); {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93141#true} {93141#true} #61#return; {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {93141#true} assume true; {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {93141#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {93141#true} call ULTIMATE.init(); {93141#true} is VALID
[2022-04-08 10:15:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked.
[2022-04-08 10:15:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359196006] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:15:05,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:15:05,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 20] total 51
[2022-04-08 10:15:05,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:15:05,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778117516]
[2022-04-08 10:15:05,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778117516] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:15:05,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:15:05,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2022-04-08 10:15:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366672894]
[2022-04-08 10:15:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:15:05,050 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44
[2022-04-08 10:15:05,050 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:15:05,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:05,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:15:05,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2022-04-08 10:15:05,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:15:05,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2022-04-08 10:15:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2245, Unknown=0, NotChecked=0, Total=2550
[2022-04-08 10:15:05,072 INFO L87 Difference]: Start difference. First operand 148 states and 188 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:15:06,948 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions.
[2022-04-08 10:15:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2022-04-08 10:15:06,948 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44
[2022-04-08 10:15:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:15:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions.
[2022-04-08 10:15:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions.
[2022-04-08 10:15:06,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 62 transitions.
[2022-04-08 10:15:06,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:15:06,999 INFO L225 Difference]: With dead ends: 179
[2022-04-08 10:15:06,999 INFO L226 Difference]: Without dead ends: 162
[2022-04-08 10:15:07,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=4593, Unknown=0, NotChecked=0, Total=5112
[2022-04-08 10:15:07,000 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-08 10:15:07,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 108 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-08 10:15:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2022-04-08 10:15:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149.
[2022-04-08 10:15:07,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:15:07,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:07,173 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:07,173 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:15:07,175 INFO L93 Difference]: Finished difference Result 162 states and 202 transitions.
[2022-04-08 10:15:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 202 transitions.
[2022-04-08 10:15:07,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:15:07,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:15:07,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 162 states.
[2022-04-08 10:15:07,175 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 162 states.
[2022-04-08 10:15:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:15:07,176 INFO L93 Difference]: Finished difference Result 162 states and 202 transitions.
[2022-04-08 10:15:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 202 transitions.
[2022-04-08 10:15:07,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:15:07,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:15:07,177 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:15:07,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:15:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 189 transitions.
[2022-04-08 10:15:07,178 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 189 transitions. Word has length 44
[2022-04-08 10:15:07,178 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:15:07,178 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 189 transitions.
[2022-04-08 10:15:07,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:07,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 189 transitions.
[2022-04-08 10:15:12,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 188 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 10:15:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 189 transitions.
[2022-04-08 10:15:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2022-04-08 10:15:12,377 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:15:12,377 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:15:12,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0
[2022-04-08 10:15:12,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102
[2022-04-08 10:15:12,578 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:15:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:15:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1592108787, now seen corresponding path program 147 times
[2022-04-08 10:15:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:15:12,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [308260316]
[2022-04-08 10:15:12,581 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:15:12,581 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:15:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1592108787, now seen corresponding path program 148 times
[2022-04-08 10:15:12,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:15:12,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92057152]
[2022-04-08 10:15:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:15:12,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:15:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:15:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:15:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:15:12,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {94505#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94480#true} is VALID
[2022-04-08 10:15:12,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {94480#true} assume true; {94480#true} is VALID
[2022-04-08 10:15:12,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94480#true} {94480#true} #61#return; {94480#true} is VALID
[2022-04-08 10:15:12,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {94480#true} call ULTIMATE.init(); {94505#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:15:12,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {94505#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94480#true} is VALID
[2022-04-08 10:15:12,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {94480#true} assume true; {94480#true} is VALID
[2022-04-08 10:15:12,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94480#true} {94480#true} #61#return; {94480#true} is VALID
[2022-04-08 10:15:12,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {94480#true} call #t~ret11 := main(); {94480#true} is VALID
[2022-04-08 10:15:12,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {94480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94485#(= main_~y~0 0)} is VALID
[2022-04-08 10:15:12,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {94485#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:15:12,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {94486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:15:12,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {94487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:15:12,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {94488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:15:12,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {94489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:15:12,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {94490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:15:12,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {94491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:15:12,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {94492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:15:12,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {94493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:15:12,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {94494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:15:12,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {94495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:12,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {94496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:15:12,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {94497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {94497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:15:12,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {94497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {94498#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:15:12,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {94498#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94499#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:15:12,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {94499#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94500#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:15:12,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {94500#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94501#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:15:12,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {94501#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94502#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:15:12,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {94502#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94503#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:15:12,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {94503#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94504#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {94504#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {94481#false} assume !(~y~0 % 4294967296 > 0); {94481#false} is VALID
[2022-04-08 10:15:12,910 INFO L272 TraceCheckUtils]: 40: Hoare triple {94481#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94481#false} is VALID
[2022-04-08 10:15:12,911 INFO L290 TraceCheckUtils]: 41: Hoare triple {94481#false} ~cond := #in~cond; {94481#false} is VALID
[2022-04-08 10:15:12,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {94481#false} assume 0 == ~cond; {94481#false} is VALID
[2022-04-08 10:15:12,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {94481#false} assume !false; {94481#false} is VALID
[2022-04-08 10:15:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:15:12,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:15:12,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92057152]
[2022-04-08 10:15:12,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92057152] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:15:12,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550954680]
[2022-04-08 10:15:12,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 10:15:12,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:15:12,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:15:12,912 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:15:12,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process
[2022-04-08 10:15:12,958 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 10:15:12,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:15:12,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjunts are in the unsatisfiable core
[2022-04-08 10:15:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:15:12,969 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:15:13,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {94480#true} call ULTIMATE.init(); {94480#true} is VALID
[2022-04-08 10:15:13,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {94480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94480#true} is VALID
[2022-04-08 10:15:13,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {94480#true} assume true; {94480#true} is VALID
[2022-04-08 10:15:13,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94480#true} {94480#true} #61#return; {94480#true} is VALID
[2022-04-08 10:15:13,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {94480#true} call #t~ret11 := main(); {94480#true} is VALID
[2022-04-08 10:15:13,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {94480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94485#(= main_~y~0 0)} is VALID
[2022-04-08 10:15:13,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {94485#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID
[2022-04-08 10:15:13,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {94486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID
[2022-04-08 10:15:13,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {94487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID
[2022-04-08 10:15:13,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {94488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID
[2022-04-08 10:15:13,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {94489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID
[2022-04-08 10:15:13,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {94490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID
[2022-04-08 10:15:13,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {94491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID
[2022-04-08 10:15:13,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {94492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID
[2022-04-08 10:15:13,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {94493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID
[2022-04-08 10:15:13,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {94494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID
[2022-04-08 10:15:13,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {94495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID
[2022-04-08 10:15:13,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {94496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:15:13,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {94497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {94497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID
[2022-04-08 10:15:13,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {94497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {94498#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID
[2022-04-08 10:15:13,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {94498#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94499#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID
[2022-04-08 10:15:13,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {94499#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94500#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID
[2022-04-08 10:15:13,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {94500#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94501#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID
[2022-04-08 10:15:13,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {94501#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94502#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID
[2022-04-08 10:15:13,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {94502#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94503#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID
[2022-04-08 10:15:13,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {94503#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94584#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID
[2022-04-08 10:15:13,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {94584#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {94481#false} is VALID
[2022-04-08 10:15:13,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {94481#false} assume !(~y~0 % 4294967296 > 0); {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L272 TraceCheckUtils]: 40: Hoare triple {94481#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {94481#false} ~cond := #in~cond; {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {94481#false} assume 0 == ~cond; {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {94481#false} assume !false; {94481#false} is VALID
[2022-04-08 10:15:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:15:13,273 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {94481#false} assume !false; {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {94481#false} assume 0 == ~cond; {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {94481#false} ~cond := #in~cond; {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L272 TraceCheckUtils]: 40: Hoare triple {94481#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {94481#false} assume !(~y~0 % 4294967296 > 0); {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {94481#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94481#false} is VALID
[2022-04-08 10:15:13,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {94690#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {94481#false} is VALID
[2022-04-08 10:15:13,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {94694#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94690#(< 0 (mod main_~z~0 4294967296))} is VALID
[2022-04-08 10:15:13,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {94698#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94694#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:15:13,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {94702#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94698#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:15:13,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {94706#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94702#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:15:13,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {94710#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94706#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:15:13,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {94714#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94710#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:15:13,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {94718#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {94714#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID
[2022-04-08 10:15:13,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {94718#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94718#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:15:13,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {94725#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94718#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:15:13,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {94729#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94725#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:15:13,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {94733#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94729#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:15:13,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {94737#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94733#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID
[2022-04-08 10:15:13,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {94741#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94737#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID
[2022-04-08 10:15:13,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {94745#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94741#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID
[2022-04-08 10:15:13,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {94749#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94745#(< 0 (mod main_~y~0 4294967296))} is VALID
[2022-04-08 10:15:13,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {94753#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94749#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID
[2022-04-08 10:15:13,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {94757#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94753#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID
[2022-04-08 10:15:13,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {94761#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94757#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID
[2022-04-08 10:15:13,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {94765#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94761#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID
[2022-04-08 10:15:13,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {94769#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94765#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID
[2022-04-08 10:15:13,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {94480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94769#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID
[2022-04-08 10:15:13,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {94480#true} call #t~ret11 := main(); {94480#true} is VALID
[2022-04-08 10:15:13,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94480#true} {94480#true} #61#return; {94480#true} is VALID
[2022-04-08 10:15:13,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {94480#true} assume true; {94480#true} is VALID
[2022-04-08 10:15:13,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {94480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94480#true} is VALID
[2022-04-08 10:15:13,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {94480#true} call ULTIMATE.init(); {94480#true} is VALID
[2022-04-08 10:15:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2022-04-08 10:15:13,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550954680] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 10:15:13,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 10:15:13,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44
[2022-04-08 10:15:13,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:15:13,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [308260316]
[2022-04-08 10:15:13,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [308260316] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:15:13,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:15:13,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-04-08 10:15:13,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920679245]
[2022-04-08 10:15:13,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:15:13,944 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44
[2022-04-08 10:15:13,945 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:15:13,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:15:13,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:15:13,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-04-08 10:15:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:15:13,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-04-08 10:15:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892
[2022-04-08 10:15:13,966 INFO L87 Difference]: Start difference. First operand 149 states and 189 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)