/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/lcm1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:48:06,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:48:06,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:48:06,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:48:06,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:48:06,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:48:06,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:48:06,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:48:06,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:48:06,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:48:06,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:48:06,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:48:06,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:48:06,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:48:06,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:48:06,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:48:06,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:48:06,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:48:06,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:48:06,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:48:06,563 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:48:06,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:48:06,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:48:06,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:48:06,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:48:06,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:48:06,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:48:06,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:48:06,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:48:06,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:48:06,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:48:06,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:48:06,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:48:06,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:48:06,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:48:06,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:48:06,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:48:06,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:48:06,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:48:06,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:48:06,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:48:06,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:48:06,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:48:06,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:48:06,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:48:06,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:48:06,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:48:06,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:48:06,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:48:06,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:48:06,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:48:06,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:48:06,592 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:48:06,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:48:06,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:48:06,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:48:06,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:48:06,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:48:06,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:48:06,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:48:06,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:48:06,593 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:48:06,593 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:48:06,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:48:06,593 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:48:06,593 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 10:48:06,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:48:06,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:48:06,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:48:06,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:48:06,819 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:48:06,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/lcm1.c [2022-04-08 10:48:06,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5108fde1/05ede08a056b43bab4110059e27969f2/FLAGc589f355e [2022-04-08 10:48:07,209 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:48:07,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm1.c [2022-04-08 10:48:07,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5108fde1/05ede08a056b43bab4110059e27969f2/FLAGc589f355e [2022-04-08 10:48:07,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5108fde1/05ede08a056b43bab4110059e27969f2 [2022-04-08 10:48:07,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:48:07,650 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:48:07,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:48:07,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:48:07,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:48:07,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10dc97ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07, skipping insertion in model container [2022-04-08 10:48:07,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:48:07,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:48:07,808 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/lcm1.c[552,565] [2022-04-08 10:48:07,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:48:07,843 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:48:07,852 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/lcm1.c[552,565] [2022-04-08 10:48:07,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:48:07,875 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:48:07,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07 WrapperNode [2022-04-08 10:48:07,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:48:07,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:48:07,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:48:07,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:48:07,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:48:07,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:48:07,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:48:07,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:48:07,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07" (1/1) ... [2022-04-08 10:48:07,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:48:07,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:48:07,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 10:48:07,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 10:48:08,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:48:08,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:48:08,005 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:48:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:48:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:48:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:48:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:48:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:48:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:48:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:48:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:48:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:48:08,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:48:08,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:48:08,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:48:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:48:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:48:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:48:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:48:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:48:08,059 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:48:08,060 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:48:08,236 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:48:08,243 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:48:08,243 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 10:48:08,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:48:08 BoogieIcfgContainer [2022-04-08 10:48:08,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:48:08,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:48:08,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:48:08,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:48:08,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:48:07" (1/3) ... [2022-04-08 10:48:08,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ca5c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:48:08, skipping insertion in model container [2022-04-08 10:48:08,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:48:07" (2/3) ... [2022-04-08 10:48:08,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ca5c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:48:08, skipping insertion in model container [2022-04-08 10:48:08,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:48:08" (3/3) ... [2022-04-08 10:48:08,251 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1.c [2022-04-08 10:48:08,258 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:48:08,259 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:48:08,300 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:48:08,305 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 10:48:08,305 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:48:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:48:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:48:08,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:48:08,323 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-08 10:48:08,324 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:48:08,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:48:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1751682979, now seen corresponding path program 1 times [2022-04-08 10:48:08,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:48:08,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113382356] [2022-04-08 10:48:08,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:48:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1751682979, now seen corresponding path program 2 times [2022-04-08 10:48:08,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:48:08,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273790201] [2022-04-08 10:48:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:48:08,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:48:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:48:08,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:48:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:48:08,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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(49, 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); {40#true} is VALID [2022-04-08 10:48:08,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 10:48:08,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #108#return; {40#true} is VALID [2022-04-08 10:48:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 10:48:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:48:08,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 10:48:08,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 10:48:08,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 10:48:08,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-08 10:48:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 10:48:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:48:08,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 10:48:08,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 10:48:08,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 10:48:08,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-08 10:48:08,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 10:48:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:48:08,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 10:48:08,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 10:48:08,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 10:48:08,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #94#return; {41#false} is VALID [2022-04-08 10:48:08,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 10:48:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:48:08,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 10:48:08,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 10:48:08,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 10:48:08,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #96#return; {41#false} is VALID [2022-04-08 10:48:08,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:48:08,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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(49, 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); {40#true} is VALID [2022-04-08 10:48:08,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 10:48:08,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #108#return; {40#true} is VALID [2022-04-08 10:48:08,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-08 10:48:08,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-04-08 10:48:08,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-08 10:48:08,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 10:48:08,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 10:48:08,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 10:48:08,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-08 10:48:08,536 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-08 10:48:08,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 10:48:08,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 10:48:08,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 10:48:08,537 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-08 10:48:08,537 INFO L272 TraceCheckUtils]: 16: Hoare triple {41#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {40#true} is VALID [2022-04-08 10:48:08,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 10:48:08,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 10:48:08,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 10:48:08,538 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {41#false} {41#false} #94#return; {41#false} is VALID [2022-04-08 10:48:08,538 INFO L272 TraceCheckUtils]: 21: Hoare triple {41#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {40#true} is VALID [2022-04-08 10:48:08,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 10:48:08,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 10:48:08,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 10:48:08,539 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {41#false} {41#false} #96#return; {41#false} is VALID [2022-04-08 10:48:08,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {41#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {41#false} is VALID [2022-04-08 10:48:08,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 10:48:08,540 INFO L272 TraceCheckUtils]: 28: Hoare triple {41#false} call __VERIFIER_assert((if (~u~0 * ~y~0 + ~v~0 * ~y~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-08 10:48:08,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 10:48:08,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 10:48:08,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 10:48:08,541 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-08 10:48:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:48:08,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273790201] [2022-04-08 10:48:08,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273790201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:48:08,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:48:08,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:48:08,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:48:08,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113382356] [2022-04-08 10:48:08,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113382356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:48:08,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:48:08,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:48:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805616611] [2022-04-08 10:48:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:48:08,549 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-08 10:48:08,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:48:08,552 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-08 10:48:08,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:48:08,579 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:48:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:48:08,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:48:08,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:48:08,597 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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-08 10:48:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:48:08,811 INFO L93 Difference]: Finished difference Result 67 states and 109 transitions. [2022-04-08 10:48:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:48:08,828 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-08 10:48:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:48:08,829 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-08 10:48:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-04-08 10:48:08,846 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-08 10:48:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-04-08 10:48:08,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2022-04-08 10:48:09,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:48:09,022 INFO L225 Difference]: With dead ends: 67 [2022-04-08 10:48:09,022 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 10:48:09,026 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-08 10:48:09,032 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:48:09,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:48:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 10:48:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 10:48:09,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:48:09,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:48:09,078 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:48:09,079 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:48:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:48:09,091 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 10:48:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 10:48:09,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:48:09,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:48:09,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-08 10:48:09,093 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-08 10:48:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:48:09,096 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 10:48:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 10:48:09,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:48:09,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:48:09,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:48:09,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:48:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:48:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 10:48:09,101 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 32 [2022-04-08 10:48:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:48:09,101 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 10:48:09,104 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-08 10:48:09,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 10:48:09,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:48:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 10:48:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:48:09,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:48:09,151 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-08 10:48:09,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:48:09,151 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:48:09,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:48:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash -442223298, now seen corresponding path program 1 times [2022-04-08 10:48:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:48:09,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [341972893] [2022-04-08 10:48:09,155 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:48:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash -442223298, now seen corresponding path program 2 times [2022-04-08 10:48:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:48:09,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594627998] [2022-04-08 10:48:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:48:09,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:48:09,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:48:09,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585174267] [2022-04-08 10:48:09,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:48:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:48:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:48:09,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:48:09,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:48:09,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:48:09,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:48:09,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:48:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:48:09,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:48:09,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2022-04-08 10:48:09,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#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(49, 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); {326#true} is VALID [2022-04-08 10:48:09,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 10:48:09,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #108#return; {326#true} is VALID [2022-04-08 10:48:09,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret6 := main(); {326#true} is VALID [2022-04-08 10:48:09,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#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; {326#true} is VALID [2022-04-08 10:48:09,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {326#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-08 10:48:09,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 10:48:09,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 10:48:09,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 10:48:09,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {326#true} {326#true} #90#return; {326#true} is VALID [2022-04-08 10:48:09,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {326#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-08 10:48:09,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 10:48:09,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 10:48:09,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 10:48:09,504 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {326#true} {326#true} #92#return; {326#true} is VALID [2022-04-08 10:48:09,504 INFO L272 TraceCheckUtils]: 16: Hoare triple {326#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {326#true} is VALID [2022-04-08 10:48:09,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 10:48:09,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 10:48:09,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 10:48:09,505 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {326#true} {326#true} #94#return; {326#true} is VALID [2022-04-08 10:48:09,505 INFO L272 TraceCheckUtils]: 21: Hoare triple {326#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {326#true} is VALID [2022-04-08 10:48:09,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 10:48:09,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 10:48:09,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 10:48:09,505 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {326#true} {326#true} #96#return; {326#true} is VALID [2022-04-08 10:48:09,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {326#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {409#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:48:09,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {409#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} assume !false; {409#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:48:09,509 INFO L272 TraceCheckUtils]: 28: Hoare triple {409#(and (= main_~v~0 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 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:48:09,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:48:09,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {327#false} is VALID [2022-04-08 10:48:09,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-08 10:48:09,511 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-08 10:48:09,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:48:09,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:48:09,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594627998] [2022-04-08 10:48:09,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:48:09,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585174267] [2022-04-08 10:48:09,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585174267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:48:09,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:48:09,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:48:09,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:48:09,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [341972893] [2022-04-08 10:48:09,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [341972893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:48:09,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:48:09,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:48:09,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875614858] [2022-04-08 10:48:09,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:48:09,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 32 [2022-04-08 10:48:09,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:48:09,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:48:09,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:48:09,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:48:09,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:48:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:48:09,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:48:09,535 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:48:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:48:09,820 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-08 10:48:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:48:09,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 32 [2022-04-08 10:48:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:48:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:48:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 10:48:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:48:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 10:48:09,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 10:48:09,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:48:09,901 INFO L225 Difference]: With dead ends: 49 [2022-04-08 10:48:09,901 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 10:48:09,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-08 10:48:09,902 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:48:09,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:48:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 10:48:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-04-08 10:48:09,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:48:09,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 10:48:09,913 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 10:48:09,914 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 10:48:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:48:09,917 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-08 10:48:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-08 10:48:09,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:48:09,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:48:09,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 47 states. [2022-04-08 10:48:09,925 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 47 states. [2022-04-08 10:48:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:48:09,928 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-08 10:48:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-08 10:48:09,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:48:09,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:48:09,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:48:09,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:48:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 10:48:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-08 10:48:09,931 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 32 [2022-04-08 10:48:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:48:09,931 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-04-08 10:48:09,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:48:09,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-08 10:48:09,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:48:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-04-08 10:48:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:48:09,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:48:09,995 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-08 10:48:10,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 10:48:10,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:48:10,213 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:48:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:48:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1300584321, now seen corresponding path program 1 times [2022-04-08 10:48:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:48:10,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1783668307] [2022-04-08 10:48:10,214 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:48:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1300584321, now seen corresponding path program 2 times [2022-04-08 10:48:10,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:48:10,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038550747] [2022-04-08 10:48:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:48:10,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:48:10,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:48:10,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912329464] [2022-04-08 10:48:10,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:48:10,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:48:10,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:48:10,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:48:10,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process