/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/nla-digbench-scaling/lcm2_unwindbound10.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 16:07:25,540 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 16:07:25,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 16:07:25,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 16:07:25,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 16:07:25,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 16:07:25,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 16:07:25,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 16:07:25,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 16:07:25,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 16:07:25,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 16:07:25,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 16:07:25,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 16:07:25,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 16:07:25,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 16:07:25,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 16:07:25,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 16:07:25,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 16:07:25,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 16:07:25,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 16:07:25,609 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 16:07:25,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 16:07:25,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 16:07:25,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 16:07:25,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 16:07:25,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 16:07:25,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 16:07:25,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 16:07:25,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 16:07:25,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 16:07:25,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 16:07:25,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 16:07:25,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 16:07:25,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 16:07:25,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 16:07:25,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 16:07:25,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 16:07:25,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 16:07:25,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 16:07:25,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 16:07:25,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 16:07:25,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 16:07:25,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-15 16:07:25,639 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 16:07:25,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 16:07:25,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 16:07:25,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 16:07:25,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 16:07:25,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 16:07:25,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 16:07:25,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 16:07:25,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 16:07:25,644 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 16:07:25,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 16:07:25,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 16:07:25,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 16:07:25,645 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 16:07:25,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 16:07:25,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 16:07:25,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 16:07:25,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 16:07:25,645 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 16:07:25,645 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 16:07:25,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 16:07:25,646 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-15 16:07:25,646 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-15 16:07:25,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 16:07:25,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 16:07:25,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 16:07:25,870 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 16:07:25,871 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 16:07:25,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound10.c
[2022-04-15 16:07:25,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5d98393/ba1fb9475c084463bc31a50cea84dcaa/FLAGaa7419f50
[2022-04-15 16:07:26,321 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 16:07:26,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound10.c
[2022-04-15 16:07:26,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5d98393/ba1fb9475c084463bc31a50cea84dcaa/FLAGaa7419f50
[2022-04-15 16:07:26,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5d98393/ba1fb9475c084463bc31a50cea84dcaa
[2022-04-15 16:07:26,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 16:07:26,341 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 16:07:26,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 16:07:26,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 16:07:26,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 16:07:26,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9ac29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26, skipping insertion in model container
[2022-04-15 16:07:26,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 16:07:26,367 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 16:07:26,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound10.c[537,550]
[2022-04-15 16:07:26,593 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 16:07:26,600 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 16:07:26,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound10.c[537,550]
[2022-04-15 16:07:26,639 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 16:07:26,655 INFO L208 MainTranslator]: Completed translation
[2022-04-15 16:07:26,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26 WrapperNode
[2022-04-15 16:07:26,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 16:07:26,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 16:07:26,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 16:07:26,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 16:07:26,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 16:07:26,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 16:07:26,700 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 16:07:26,700 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 16:07:26,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26" (1/1) ...
[2022-04-15 16:07:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 16:07:26,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 16:07:26,726 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-15 16:07:26,728 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-15 16:07:26,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 16:07:26,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 16:07:26,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 16:07:26,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 16:07:26,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 16:07:26,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 16:07:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 16:07:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 16:07:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 16:07:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 16:07:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2022-04-15 16:07:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 16:07:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 16:07:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 16:07:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 16:07:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 16:07:26,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 16:07:26,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 16:07:26,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 16:07:26,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 16:07:26,802 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 16:07:26,803 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 16:07:26,962 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 16:07:26,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 16:07:26,969 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-15 16:07:26,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:07:26 BoogieIcfgContainer
[2022-04-15 16:07:26,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 16:07:26,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 16:07:26,972 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 16:07:26,975 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 16:07:26,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 04:07:26" (1/3) ...
[2022-04-15 16:07:26,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a851539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:07:26, skipping insertion in model container
[2022-04-15 16:07:26,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:07:26" (2/3) ...
[2022-04-15 16:07:26,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a851539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:07:26, skipping insertion in model container
[2022-04-15 16:07:26,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:07:26" (3/3) ...
[2022-04-15 16:07:26,977 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_unwindbound10.c
[2022-04-15 16:07:26,981 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 16:07:26,981 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 16:07:27,017 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 16:07:27,023 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-15 16:07:27,024 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 16:07:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 16:07:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-15 16:07:27,046 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 16:07:27,047 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 16:07:27,047 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 16:07:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 16:07:27,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2009995470, now seen corresponding path program 1 times
[2022-04-15 16:07:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:07:27,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869187799]
[2022-04-15 16:07:27,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 16:07:27,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2009995470, now seen corresponding path program 2 times
[2022-04-15 16:07:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 16:07:27,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099003142]
[2022-04-15 16:07:27,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 16:07:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 16:07:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:07:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 16:07:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:07:27,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID
[2022-04-15 16:07:27,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID
[2022-04-15 16:07:27,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID
[2022-04-15 16:07:27,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-15 16:07:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:07:27,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID
[2022-04-15 16:07:27,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID
[2022-04-15 16:07:27,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID
[2022-04-15 16:07:27,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID
[2022-04-15 16:07:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-15 16:07:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:07:27,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID
[2022-04-15 16:07:27,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID
[2022-04-15 16:07:27,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID
[2022-04-15 16:07:27,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID
[2022-04-15 16:07:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2022-04-15 16:07:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:07:27,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID
[2022-04-15 16:07:27,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID
[2022-04-15 16:07:27,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID
[2022-04-15 16:07:27,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID
[2022-04-15 16:07:27,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2022-04-15 16:07:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:07:27,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID
[2022-04-15 16:07:27,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID
[2022-04-15 16:07:27,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID
[2022-04-15 16:07:27,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID
[2022-04-15 16:07:27,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 16:07:27,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID
[2022-04-15 16:07:27,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID
[2022-04-15 16:07:27,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID
[2022-04-15 16:07:27,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID
[2022-04-15 16:07:27,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {35#true} is VALID
[2022-04-15 16:07:27,450 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {35#true} is VALID
[2022-04-15 16:07:27,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID
[2022-04-15 16:07:27,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID
[2022-04-15 16:07:27,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID
[2022-04-15 16:07:27,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID
[2022-04-15 16:07:27,452 INFO L272 TraceCheckUtils]: 11: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {35#true} is VALID
[2022-04-15 16:07:27,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID
[2022-04-15 16:07:27,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID
[2022-04-15 16:07:27,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} assume true; {36#false} is VALID
[2022-04-15 16:07:27,453 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID
[2022-04-15 16:07:27,454 INFO L272 TraceCheckUtils]: 16: Hoare triple {36#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {35#true} is VALID
[2022-04-15 16:07:27,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID
[2022-04-15 16:07:27,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID
[2022-04-15 16:07:27,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {36#false} assume true; {36#false} is VALID
[2022-04-15 16:07:27,455 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID
[2022-04-15 16:07:27,456 INFO L272 TraceCheckUtils]: 21: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {35#true} is VALID
[2022-04-15 16:07:27,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID
[2022-04-15 16:07:27,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID
[2022-04-15 16:07:27,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {36#false} assume true; {36#false} is VALID
[2022-04-15 16:07:27,458 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID
[2022-04-15 16:07:27,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {36#false} is VALID
[2022-04-15 16:07:27,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !true; {36#false} is VALID
[2022-04-15 16:07:27,459 INFO L272 TraceCheckUtils]: 28: Hoare triple {36#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {36#false} is VALID
[2022-04-15 16:07:27,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID
[2022-04-15 16:07:27,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID
[2022-04-15 16:07:27,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID
[2022-04-15 16:07:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-15 16:07:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 16:07:27,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099003142]
[2022-04-15 16:07:27,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099003142] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:07:27,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:07:27,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 16:07:27,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 16:07:27,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869187799]
[2022-04-15 16:07:27,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869187799] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:07:27,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:07:27,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 16:07:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50627224]
[2022-04-15 16:07:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 16:07:27,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32
[2022-04-15 16:07:27,478 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 16:07:27,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:27,521 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-15 16:07:27,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 16:07:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:07:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 16:07:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 16:07:27,547 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:27,694 INFO L93 Difference]: Finished difference Result 58 states and 82 transitions.
[2022-04-15 16:07:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 16:07:27,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32
[2022-04-15 16:07:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 16:07:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions.
[2022-04-15 16:07:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions.
[2022-04-15 16:07:27,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 82 transitions.
[2022-04-15 16:07:27,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 16:07:27,817 INFO L225 Difference]: With dead ends: 58
[2022-04-15 16:07:27,817 INFO L226 Difference]: Without dead ends: 28
[2022-04-15 16:07:27,819 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 16:07:27,822 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 16:07:27,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 16:07:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2022-04-15 16:07:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27.
[2022-04-15 16:07:27,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 16:07:27,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-15 16:07:27,849 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-15 16:07:27,849 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-15 16:07:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:27,853 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions.
[2022-04-15 16:07:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions.
[2022-04-15 16:07:27,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:07:27,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:07:27,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states.
[2022-04-15 16:07:27,854 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states.
[2022-04-15 16:07:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:27,857 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions.
[2022-04-15 16:07:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions.
[2022-04-15 16:07:27,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:07:27,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:07:27,858 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 16:07:27,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 16:07:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-15 16:07:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions.
[2022-04-15 16:07:27,862 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32
[2022-04-15 16:07:27,862 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 16:07:27,862 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions.
[2022-04-15 16:07:27,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:27,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions.
[2022-04-15 16:07:27,897 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-15 16:07:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions.
[2022-04-15 16:07:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-15 16:07:27,898 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 16:07:27,899 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 16:07:27,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 16:07:27,899 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 16:07:27,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 16:07:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash -756409738, now seen corresponding path program 1 times
[2022-04-15 16:07:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:07:27,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553797821]
[2022-04-15 16:07:27,901 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 16:07:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -756409738, now seen corresponding path program 2 times
[2022-04-15 16:07:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 16:07:27,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221749260]
[2022-04-15 16:07:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 16:07:27,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 16:07:27,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 16:07:27,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [421568026]
[2022-04-15 16:07:27,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 16:07:27,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 16:07:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 16:07:27,935 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-15 16:07:27,971 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-15 16:07:27,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 16:07:27,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 16:07:28,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-15 16:07:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:07:28,036 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 16:07:28,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID
[2022-04-15 16:07:28,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#(<= ~counter~0 0)} {285#true} #73#return; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#(<= ~counter~0 0)} call #t~ret7 := main(); {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {293#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#(<= ~counter~0 0)} ~cond := #in~cond; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#(<= ~counter~0 0)} assume !(0 == ~cond); {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {293#(<= ~counter~0 0)} {293#(<= ~counter~0 0)} #61#return; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,296 INFO L272 TraceCheckUtils]: 11: Hoare triple {293#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(<= ~counter~0 0)} ~cond := #in~cond; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(<= ~counter~0 0)} assume !(0 == ~cond); {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,298 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {293#(<= ~counter~0 0)} {293#(<= ~counter~0 0)} #63#return; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,299 INFO L272 TraceCheckUtils]: 16: Hoare triple {293#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {293#(<= ~counter~0 0)} ~cond := #in~cond; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {293#(<= ~counter~0 0)} assume !(0 == ~cond); {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,302 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {293#(<= ~counter~0 0)} {293#(<= ~counter~0 0)} #65#return; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,303 INFO L272 TraceCheckUtils]: 21: Hoare triple {293#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {293#(<= ~counter~0 0)} ~cond := #in~cond; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {293#(<= ~counter~0 0)} assume !(0 == ~cond); {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,305 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {293#(<= ~counter~0 0)} {293#(<= ~counter~0 0)} #67#return; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {293#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {293#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:28,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {293#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {372#(<= |main_#t~post6| 0)} is VALID
[2022-04-15 16:07:28,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {372#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {286#false} is VALID
[2022-04-15 16:07:28,306 INFO L272 TraceCheckUtils]: 29: Hoare triple {286#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {286#false} is VALID
[2022-04-15 16:07:28,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {286#false} ~cond := #in~cond; {286#false} is VALID
[2022-04-15 16:07:28,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {286#false} assume 0 == ~cond; {286#false} is VALID
[2022-04-15 16:07:28,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {286#false} assume !false; {286#false} is VALID
[2022-04-15 16:07:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-15 16:07:28,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 16:07:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 16:07:28,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221749260]
[2022-04-15 16:07:28,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 16:07:28,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421568026]
[2022-04-15 16:07:28,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421568026] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:07:28,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:07:28,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 16:07:28,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 16:07:28,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553797821]
[2022-04-15 16:07:28,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553797821] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:07:28,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:07:28,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 16:07:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895982949]
[2022-04-15 16:07:28,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 16:07:28,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33
[2022-04-15 16:07:28,311 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 16:07:28,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:28,336 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-15 16:07:28,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-15 16:07:28,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:07:28,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-15 16:07:28,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 16:07:28,340 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:28,443 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions.
[2022-04-15 16:07:28,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-15 16:07:28,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33
[2022-04-15 16:07:28,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 16:07:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions.
[2022-04-15 16:07:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions.
[2022-04-15 16:07:28,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions.
[2022-04-15 16:07:28,496 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-15 16:07:28,499 INFO L225 Difference]: With dead ends: 36
[2022-04-15 16:07:28,499 INFO L226 Difference]: Without dead ends: 29
[2022-04-15 16:07:28,500 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 16:07:28,502 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 16:07:28,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 16:07:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2022-04-15 16:07:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2022-04-15 16:07:28,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 16:07:28,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-15 16:07:28,531 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-15 16:07:28,531 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-15 16:07:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:28,535 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions.
[2022-04-15 16:07:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions.
[2022-04-15 16:07:28,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:07:28,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:07:28,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states.
[2022-04-15 16:07:28,539 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states.
[2022-04-15 16:07:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:28,541 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions.
[2022-04-15 16:07:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions.
[2022-04-15 16:07:28,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:07:28,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:07:28,546 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 16:07:28,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 16:07:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-15 16:07:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions.
[2022-04-15 16:07:28,552 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 33
[2022-04-15 16:07:28,552 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 16:07:28,552 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions.
[2022-04-15 16:07:28,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 16:07:28,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions.
[2022-04-15 16:07:28,594 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-15 16:07:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions.
[2022-04-15 16:07:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-15 16:07:28,595 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 16:07:28,596 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 16:07:28,618 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-15 16:07:28,811 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-15 16:07:28,812 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 16:07:28,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 16:07:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -754622278, now seen corresponding path program 1 times
[2022-04-15 16:07:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:07:28,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933881284]
[2022-04-15 16:07:28,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 16:07:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash -754622278, now seen corresponding path program 2 times
[2022-04-15 16:07:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 16:07:28,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214323886]
[2022-04-15 16:07:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 16:07:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 16:07:28,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 16:07:28,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373807186]
[2022-04-15 16:07:28,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 16:07:28,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 16:07:28,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 16:07:28,836 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-15 16:07:28,841 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-15 16:07:28,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 16:07:28,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 16:07:28,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-15 16:07:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:07:28,941 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 16:07:29,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {575#true} is VALID
[2022-04-15 16:07:29,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {575#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {575#true} is VALID
[2022-04-15 16:07:29,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID
[2022-04-15 16:07:29,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {575#true} {575#true} #73#return; {575#true} is VALID
[2022-04-15 16:07:29,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {575#true} call #t~ret7 := main(); {575#true} is VALID
[2022-04-15 16:07:29,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {575#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {575#true} is VALID
[2022-04-15 16:07:29,247 INFO L272 TraceCheckUtils]: 6: Hoare triple {575#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {575#true} is VALID
[2022-04-15 16:07:29,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID
[2022-04-15 16:07:29,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID
[2022-04-15 16:07:29,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#true} assume true; {575#true} is VALID
[2022-04-15 16:07:29,248 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {575#true} {575#true} #61#return; {575#true} is VALID
[2022-04-15 16:07:29,248 INFO L272 TraceCheckUtils]: 11: Hoare triple {575#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {575#true} is VALID
[2022-04-15 16:07:29,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID
[2022-04-15 16:07:29,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID
[2022-04-15 16:07:29,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#true} assume true; {575#true} is VALID
[2022-04-15 16:07:29,249 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {575#true} {575#true} #63#return; {575#true} is VALID
[2022-04-15 16:07:29,249 INFO L272 TraceCheckUtils]: 16: Hoare triple {575#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {575#true} is VALID
[2022-04-15 16:07:29,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID
[2022-04-15 16:07:29,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID
[2022-04-15 16:07:29,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#true} assume true; {575#true} is VALID
[2022-04-15 16:07:29,249 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {575#true} {575#true} #65#return; {575#true} is VALID
[2022-04-15 16:07:29,250 INFO L272 TraceCheckUtils]: 21: Hoare triple {575#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {575#true} is VALID
[2022-04-15 16:07:29,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID
[2022-04-15 16:07:29,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID
[2022-04-15 16:07:29,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {575#true} assume true; {575#true} is VALID
[2022-04-15 16:07:29,250 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {575#true} {575#true} #67#return; {575#true} is VALID
[2022-04-15 16:07:29,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {575#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {658#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-15 16:07:29,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {658#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {658#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-15 16:07:29,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {658#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {658#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID
[2022-04-15 16:07:29,253 INFO L272 TraceCheckUtils]: 29: Hoare triple {658#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 16:07:29,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {672#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 16:07:29,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {576#false} is VALID
[2022-04-15 16:07:29,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {576#false} assume !false; {576#false} is VALID
[2022-04-15 16:07:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-15 16:07:29,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 16:07:29,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 16:07:29,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214323886]
[2022-04-15 16:07:29,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 16:07:29,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373807186]
[2022-04-15 16:07:29,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373807186] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:07:29,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:07:29,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 16:07:29,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 16:07:29,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933881284]
[2022-04-15 16:07:29,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933881284] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:07:29,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:07:29,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 16:07:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867181768]
[2022-04-15 16:07:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 16:07:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33
[2022-04-15 16:07:29,257 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 16:07:29,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-15 16:07:29,279 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-15 16:07:29,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 16:07:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:07:29,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 16:07:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 16:07:29,281 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-15 16:07:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:29,495 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions.
[2022-04-15 16:07:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 16:07:29,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33
[2022-04-15 16:07:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 16:07:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-15 16:07:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions.
[2022-04-15 16:07:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-15 16:07:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions.
[2022-04-15 16:07:29,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions.
[2022-04-15 16:07:29,549 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-15 16:07:29,550 INFO L225 Difference]: With dead ends: 39
[2022-04-15 16:07:29,550 INFO L226 Difference]: Without dead ends: 36
[2022-04-15 16:07:29,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-15 16:07:29,551 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-15 16:07:29,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 16:07:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2022-04-15 16:07:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35.
[2022-04-15 16:07:29,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 16:07:29,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 16:07:29,576 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 16:07:29,576 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 16:07:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:29,580 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions.
[2022-04-15 16:07:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions.
[2022-04-15 16:07:29,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:07:29,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:07:29,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states.
[2022-04-15 16:07:29,581 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states.
[2022-04-15 16:07:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:29,583 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions.
[2022-04-15 16:07:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions.
[2022-04-15 16:07:29,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:07:29,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:07:29,584 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 16:07:29,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 16:07:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 16:07:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions.
[2022-04-15 16:07:29,586 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33
[2022-04-15 16:07:29,587 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 16:07:29,587 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions.
[2022-04-15 16:07:29,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-15 16:07:29,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions.
[2022-04-15 16:07:29,636 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-15 16:07:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions.
[2022-04-15 16:07:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2022-04-15 16:07:29,637 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 16:07:29,638 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 16:07:29,644 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-15 16:07:29,839 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-15 16:07:29,840 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 16:07:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 16:07:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash 756635198, now seen corresponding path program 1 times
[2022-04-15 16:07:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:07:29,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158892072]
[2022-04-15 16:07:29,841 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 16:07:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash 756635198, now seen corresponding path program 2 times
[2022-04-15 16:07:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 16:07:29,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961684409]
[2022-04-15 16:07:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 16:07:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 16:07:29,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 16:07:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [952543277]
[2022-04-15 16:07:29,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 16:07:29,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 16:07:29,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 16:07:29,864 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-15 16:07:29,872 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-15 16:07:29,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 16:07:29,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 16:07:29,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 16:07:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:07:29,943 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 16:07:30,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID
[2022-04-15 16:07:30,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {908#(<= ~counter~0 0)} {900#true} #73#return; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {908#(<= ~counter~0 0)} call #t~ret7 := main(); {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {908#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {908#(<= ~counter~0 0)} ~cond := #in~cond; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {908#(<= ~counter~0 0)} assume !(0 == ~cond); {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,158 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {908#(<= ~counter~0 0)} {908#(<= ~counter~0 0)} #61#return; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,158 INFO L272 TraceCheckUtils]: 11: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {908#(<= ~counter~0 0)} ~cond := #in~cond; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {908#(<= ~counter~0 0)} assume !(0 == ~cond); {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,160 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {908#(<= ~counter~0 0)} {908#(<= ~counter~0 0)} #63#return; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,160 INFO L272 TraceCheckUtils]: 16: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {908#(<= ~counter~0 0)} ~cond := #in~cond; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {908#(<= ~counter~0 0)} assume !(0 == ~cond); {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,162 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {908#(<= ~counter~0 0)} {908#(<= ~counter~0 0)} #65#return; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,162 INFO L272 TraceCheckUtils]: 21: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {908#(<= ~counter~0 0)} ~cond := #in~cond; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {908#(<= ~counter~0 0)} assume !(0 == ~cond); {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,164 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {908#(<= ~counter~0 0)} {908#(<= ~counter~0 0)} #67#return; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {908#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {908#(<= ~counter~0 0)} is VALID
[2022-04-15 16:07:30,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {987#(<= ~counter~0 1)} is VALID
[2022-04-15 16:07:30,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {987#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {987#(<= ~counter~0 1)} is VALID
[2022-04-15 16:07:30,166 INFO L272 TraceCheckUtils]: 29: Hoare triple {987#(<= ~counter~0 1)} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {987#(<= ~counter~0 1)} is VALID
[2022-04-15 16:07:30,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {987#(<= ~counter~0 1)} ~cond := #in~cond; {987#(<= ~counter~0 1)} is VALID
[2022-04-15 16:07:30,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {987#(<= ~counter~0 1)} assume !(0 == ~cond); {987#(<= ~counter~0 1)} is VALID
[2022-04-15 16:07:30,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {987#(<= ~counter~0 1)} assume true; {987#(<= ~counter~0 1)} is VALID
[2022-04-15 16:07:30,167 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {987#(<= ~counter~0 1)} {987#(<= ~counter~0 1)} #69#return; {987#(<= ~counter~0 1)} is VALID
[2022-04-15 16:07:30,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {987#(<= ~counter~0 1)} assume !!(~x~0 % 4294967296 != ~y~0 % 4294967296); {987#(<= ~counter~0 1)} is VALID
[2022-04-15 16:07:30,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {987#(<= ~counter~0 1)} assume ~x~0 % 4294967296 > ~y~0 % 4294967296;~x~0 := ~x~0 - ~y~0;~v~0 := ~v~0 + ~u~0; {987#(<= ~counter~0 1)} is VALID
[2022-04-15 16:07:30,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {987#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1015#(<= |main_#t~post6| 1)} is VALID
[2022-04-15 16:07:30,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {1015#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {901#false} is VALID
[2022-04-15 16:07:30,169 INFO L272 TraceCheckUtils]: 38: Hoare triple {901#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {901#false} is VALID
[2022-04-15 16:07:30,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} ~cond := #in~cond; {901#false} is VALID
[2022-04-15 16:07:30,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {901#false} assume 0 == ~cond; {901#false} is VALID
[2022-04-15 16:07:30,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {901#false} assume !false; {901#false} is VALID
[2022-04-15 16:07:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-15 16:07:30,170 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 16:07:30,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {901#false} assume !false; {901#false} is VALID
[2022-04-15 16:07:30,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {901#false} assume 0 == ~cond; {901#false} is VALID
[2022-04-15 16:07:30,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} ~cond := #in~cond; {901#false} is VALID
[2022-04-15 16:07:30,382 INFO L272 TraceCheckUtils]: 38: Hoare triple {901#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {901#false} is VALID
[2022-04-15 16:07:30,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {1043#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {901#false} is VALID
[2022-04-15 16:07:30,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {1047#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1043#(< |main_#t~post6| 10)} is VALID
[2022-04-15 16:07:30,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {1047#(< ~counter~0 10)} assume ~x~0 % 4294967296 > ~y~0 % 4294967296;~x~0 := ~x~0 - ~y~0;~v~0 := ~v~0 + ~u~0; {1047#(< ~counter~0 10)} is VALID
[2022-04-15 16:07:30,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {1047#(< ~counter~0 10)} assume !!(~x~0 % 4294967296 != ~y~0 % 4294967296); {1047#(< ~counter~0 10)} is VALID
[2022-04-15 16:07:30,385 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {900#true} {1047#(< ~counter~0 10)} #69#return; {1047#(< ~counter~0 10)} is VALID
[2022-04-15 16:07:30,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-15 16:07:30,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-15 16:07:30,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-15 16:07:30,385 INFO L272 TraceCheckUtils]: 29: Hoare triple {1047#(< ~counter~0 10)} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {900#true} is VALID
[2022-04-15 16:07:30,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {1047#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {1047#(< ~counter~0 10)} is VALID
[2022-04-15 16:07:30,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {1075#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1047#(< ~counter~0 10)} is VALID
[2022-04-15 16:07:30,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {1075#(< ~counter~0 9)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,388 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {900#true} {1075#(< ~counter~0 9)} #67#return; {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-15 16:07:30,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-15 16:07:30,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-15 16:07:30,388 INFO L272 TraceCheckUtils]: 21: Hoare triple {1075#(< ~counter~0 9)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {900#true} is VALID
[2022-04-15 16:07:30,389 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {900#true} {1075#(< ~counter~0 9)} #65#return; {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-15 16:07:30,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-15 16:07:30,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-15 16:07:30,389 INFO L272 TraceCheckUtils]: 16: Hoare triple {1075#(< ~counter~0 9)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {900#true} is VALID
[2022-04-15 16:07:30,390 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {1075#(< ~counter~0 9)} #63#return; {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-15 16:07:30,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-15 16:07:30,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-15 16:07:30,390 INFO L272 TraceCheckUtils]: 11: Hoare triple {1075#(< ~counter~0 9)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {900#true} is VALID
[2022-04-15 16:07:30,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {1075#(< ~counter~0 9)} #61#return; {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID
[2022-04-15 16:07:30,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID
[2022-04-15 16:07:30,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID
[2022-04-15 16:07:30,391 INFO L272 TraceCheckUtils]: 6: Hoare triple {1075#(< ~counter~0 9)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {900#true} is VALID
[2022-04-15 16:07:30,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {1075#(< ~counter~0 9)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {1075#(< ~counter~0 9)} call #t~ret7 := main(); {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1075#(< ~counter~0 9)} {900#true} #73#return; {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {1075#(< ~counter~0 9)} assume true; {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(50, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1075#(< ~counter~0 9)} is VALID
[2022-04-15 16:07:30,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID
[2022-04-15 16:07:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-15 16:07:30,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 16:07:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961684409]
[2022-04-15 16:07:30,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 16:07:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952543277]
[2022-04-15 16:07:30,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952543277] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 16:07:30,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 16:07:30,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2022-04-15 16:07:30,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 16:07:30,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158892072]
[2022-04-15 16:07:30,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158892072] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:07:30,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:07:30,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 16:07:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739326790]
[2022-04-15 16:07:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 16:07:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42
[2022-04-15 16:07:30,396 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 16:07:30,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-15 16:07:30,424 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-15 16:07:30,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 16:07:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:07:30,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 16:07:30,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2022-04-15 16:07:30,425 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-15 16:07:30,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:30,567 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions.
[2022-04-15 16:07:30,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-15 16:07:30,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42
[2022-04-15 16:07:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 16:07:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-15 16:07:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions.
[2022-04-15 16:07:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-15 16:07:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions.
[2022-04-15 16:07:30,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 52 transitions.
[2022-04-15 16:07:30,611 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-15 16:07:30,613 INFO L225 Difference]: With dead ends: 45
[2022-04-15 16:07:30,613 INFO L226 Difference]: Without dead ends: 38
[2022-04-15 16:07:30,613 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2022-04-15 16:07:30,614 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 16:07:30,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 90 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 16:07:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2022-04-15 16:07:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38.
[2022-04-15 16:07:30,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 16:07:30,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 16:07:30,641 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 16:07:30,642 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 16:07:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:30,647 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions.
[2022-04-15 16:07:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions.
[2022-04-15 16:07:30,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:07:30,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:07:30,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states.
[2022-04-15 16:07:30,649 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states.
[2022-04-15 16:07:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:07:30,652 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions.
[2022-04-15 16:07:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions.
[2022-04-15 16:07:30,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:07:30,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:07:30,653 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 16:07:30,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 16:07:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 16:07:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions.
[2022-04-15 16:07:30,658 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 42
[2022-04-15 16:07:30,660 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 16:07:30,660 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions.
[2022-04-15 16:07:30,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2022-04-15 16:07:30,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 45 transitions.
[2022-04-15 16:07:30,707 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-15 16:07:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions.
[2022-04-15 16:07:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2022-04-15 16:07:30,708 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 16:07:30,708 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 16:07:30,727 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-15 16:07:30,919 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-15 16:07:30,920 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 16:07:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 16:07:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash 758422658, now seen corresponding path program 1 times
[2022-04-15 16:07:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:07:30,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [404590235]
[2022-04-15 16:07:30,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 16:07:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash 758422658, now seen corresponding path program 2 times
[2022-04-15 16:07:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 16:07:30,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070265157]
[2022-04-15 16:07:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 16:07:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 16:07:30,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 16:07:30,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643326059]
[2022-04-15 16:07:30,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 16:07:30,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 16:07:30,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 16:07:30,948 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-15 16:07:30,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process