/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:09:49,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:09:49,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:09:49,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:09:49,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:09:49,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:09:49,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:09:49,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:09:49,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:09:49,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:09:49,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:09:49,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:09:49,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:09:49,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:09:49,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:09:49,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:09:49,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:09:49,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:09:49,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:09:49,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:09:49,190 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:09:49,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:09:49,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:09:49,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:09:49,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:09:49,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:09:49,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:09:49,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:09:49,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:09:49,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:09:49,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:09:49,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:09:49,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:09:49,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:09:49,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:09:49,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:09:49,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:09:49,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:09:49,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:09:49,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:09:49,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:09:49,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:09:49,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:09:49,220 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:09:49,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:09:49,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:09:49,221 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:09:49,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:09:49,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:09:49,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:09:49,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:09:49,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:09:49,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:09:49,222 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:09:49,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:09:49,223 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:09:49,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:09:49,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:09:49,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:09:49,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:09:49,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:09:49,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:09:49,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:09:49,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:09:49,223 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:09:49,223 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:09:49,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:09:49,224 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:09:49,224 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 04:09:49,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:09:49,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:09:49,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:09:49,453 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:09:49,454 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:09:49,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-08 04:09:49,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dac7e100/e209c784d07e4eb2922dd0d3381911c8/FLAGbf586316d [2022-04-08 04:09:49,876 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:09:49,877 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-08 04:09:49,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dac7e100/e209c784d07e4eb2922dd0d3381911c8/FLAGbf586316d [2022-04-08 04:09:49,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dac7e100/e209c784d07e4eb2922dd0d3381911c8 [2022-04-08 04:09:49,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:09:49,891 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:09:49,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:09:49,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:09:49,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:09:49,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:09:49" (1/1) ... [2022-04-08 04:09:49,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c33df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:49, skipping insertion in model container [2022-04-08 04:09:49,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:09:49" (1/1) ... [2022-04-08 04:09:49,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:09:49,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:09:50,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c[321,334] [2022-04-08 04:09:50,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:09:50,062 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:09:50,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c[321,334] [2022-04-08 04:09:50,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:09:50,080 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:09:50,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50 WrapperNode [2022-04-08 04:09:50,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:09:50,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:09:50,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:09:50,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:09:50,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50" (1/1) ... [2022-04-08 04:09:50,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50" (1/1) ... [2022-04-08 04:09:50,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50" (1/1) ... [2022-04-08 04:09:50,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50" (1/1) ... [2022-04-08 04:09:50,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50" (1/1) ... [2022-04-08 04:09:50,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50" (1/1) ... [2022-04-08 04:09:50,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50" (1/1) ... [2022-04-08 04:09:50,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:09:50,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:09:50,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:09:50,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:09:50,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50" (1/1) ... [2022-04-08 04:09:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:09:50,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:09:50,118 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 04:09:50,122 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 04:09:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:09:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:09:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:09:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:09:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:09:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:09:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:09:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:09:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:09:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:09:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:09:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:09:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:09:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:09:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:09:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:09:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:09:50,182 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:09:50,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:09:50,299 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:09:50,304 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:09:50,304 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 04:09:50,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:09:50 BoogieIcfgContainer [2022-04-08 04:09:50,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:09:50,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:09:50,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:09:50,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:09:50,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:09:49" (1/3) ... [2022-04-08 04:09:50,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e253412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:09:50, skipping insertion in model container [2022-04-08 04:09:50,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:50" (2/3) ... [2022-04-08 04:09:50,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e253412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:09:50, skipping insertion in model container [2022-04-08 04:09:50,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:09:50" (3/3) ... [2022-04-08 04:09:50,328 INFO L111 eAbstractionObserver]: Analyzing ICFG nested3-2.c [2022-04-08 04:09:50,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:09:50,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:09:50,385 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:09:50,394 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 04:09:50,394 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:09:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:09:50,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:09:50,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:09:50,420 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:09:50,420 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:09:50,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:09:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1794590667, now seen corresponding path program 1 times [2022-04-08 04:09:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:50,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857179561] [2022-04-08 04:09:50,438 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:09:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1794590667, now seen corresponding path program 2 times [2022-04-08 04:09:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:09:50,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447700826] [2022-04-08 04:09:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:09:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:09:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:09:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:50,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(12, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-08 04:09:50,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 04:09:50,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-08 04:09:50,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:09:50,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(12, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-08 04:09:50,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 04:09:50,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-08 04:09:50,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret7 := main(); {28#true} is VALID [2022-04-08 04:09:50,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {28#true} is VALID [2022-04-08 04:09:50,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-08 04:09:50,609 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-08 04:09:50,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-08 04:09:50,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-08 04:09:50,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-08 04:09:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:09:50,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:09:50,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447700826] [2022-04-08 04:09:50,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447700826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:50,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:50,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:09:50,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:09:50,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857179561] [2022-04-08 04:09:50,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857179561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:50,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:50,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:09:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110537568] [2022-04-08 04:09:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:09:50,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:09:50,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:09:50,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:50,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:50,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:09:50,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:50,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:09:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:09:50,660 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:50,768 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-08 04:09:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:09:50,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:09:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:09:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-08 04:09:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-08 04:09:50,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-08 04:09:50,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:50,894 INFO L225 Difference]: With dead ends: 44 [2022-04-08 04:09:50,894 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 04:09:50,897 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 04:09:50,899 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:09:50,901 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:09:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 04:09:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 04:09:50,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:09:50,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:50,925 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:50,925 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:50,928 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-08 04:09:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-08 04:09:50,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:50,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:50,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-08 04:09:50,930 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-08 04:09:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:50,932 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-08 04:09:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-08 04:09:50,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:50,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:50,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:09:50,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:09:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-08 04:09:50,936 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-04-08 04:09:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:09:50,936 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-08 04:09:50,937 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:50,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-08 04:09:50,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-08 04:09:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:09:50,985 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:09:50,985 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:09:50,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:09:50,989 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:09:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:09:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1824143339, now seen corresponding path program 1 times [2022-04-08 04:09:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:50,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415214112] [2022-04-08 04:09:50,991 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:09:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1824143339, now seen corresponding path program 2 times [2022-04-08 04:09:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:09:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629296500] [2022-04-08 04:09:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:09:50,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:09:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:09:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:51,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#(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(12, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-08 04:09:51,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-08 04:09:51,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #63#return; {204#true} is VALID [2022-04-08 04:09:51,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:09:51,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#(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(12, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-08 04:09:51,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-08 04:09:51,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #63#return; {204#true} is VALID [2022-04-08 04:09:51,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret7 := main(); {204#true} is VALID [2022-04-08 04:09:51,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {209#(= main_~x~0 0)} is VALID [2022-04-08 04:09:51,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {205#false} is VALID [2022-04-08 04:09:51,095 INFO L272 TraceCheckUtils]: 7: Hoare triple {205#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {205#false} is VALID [2022-04-08 04:09:51,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2022-04-08 04:09:51,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#false} assume 0 == ~cond; {205#false} is VALID [2022-04-08 04:09:51,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {205#false} assume !false; {205#false} is VALID [2022-04-08 04:09:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:09:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:09:51,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629296500] [2022-04-08 04:09:51,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629296500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:51,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:51,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:09:51,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:09:51,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415214112] [2022-04-08 04:09:51,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415214112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:51,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:51,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:09:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347980578] [2022-04-08 04:09:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:09:51,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:09:51,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:09:51,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:51,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:09:51,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:51,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:09:51,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:09:51,109 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:51,217 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-08 04:09:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:09:51,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:09:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:09:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-08 04:09:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-08 04:09:51,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-08 04:09:51,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:51,264 INFO L225 Difference]: With dead ends: 34 [2022-04-08 04:09:51,264 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 04:09:51,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:09:51,268 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:09:51,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:09:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 04:09:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-04-08 04:09:51,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:09:51,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,280 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,280 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:51,281 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-08 04:09:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-08 04:09:51,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:51,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:51,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 04:09:51,282 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 04:09:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:51,284 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-08 04:09:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-08 04:09:51,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:51,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:51,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:09:51,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:09:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-08 04:09:51,286 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2022-04-08 04:09:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:09:51,286 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-08 04:09:51,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-08 04:09:51,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-08 04:09:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 04:09:51,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:09:51,310 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:09:51,310 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:09:51,310 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:09:51,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:09:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash -699512288, now seen corresponding path program 1 times [2022-04-08 04:09:51,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:51,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305865435] [2022-04-08 04:09:51,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:09:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash -699512288, now seen corresponding path program 2 times [2022-04-08 04:09:51,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:09:51,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640251533] [2022-04-08 04:09:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:09:51,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:09:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:09:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:51,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(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(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-08 04:09:51,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-08 04:09:51,363 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #63#return; {379#true} is VALID [2022-04-08 04:09:51,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:09:51,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(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(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-08 04:09:51,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-08 04:09:51,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #63#return; {379#true} is VALID [2022-04-08 04:09:51,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret7 := main(); {379#true} is VALID [2022-04-08 04:09:51,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {379#true} is VALID [2022-04-08 04:09:51,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {384#(= main_~y~0 0)} is VALID [2022-04-08 04:09:51,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#(= main_~y~0 0)} assume !(~y~0 % 4294967296 < 268435455); {380#false} is VALID [2022-04-08 04:09:51,366 INFO L272 TraceCheckUtils]: 8: Hoare triple {380#false} call __VERIFIER_assert((if 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {380#false} is VALID [2022-04-08 04:09:51,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-08 04:09:51,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-08 04:09:51,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-08 04:09:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:09:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:09:51,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640251533] [2022-04-08 04:09:51,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640251533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:51,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:51,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:09:51,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:09:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305865435] [2022-04-08 04:09:51,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305865435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:51,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:51,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:09:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915259011] [2022-04-08 04:09:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:09:51,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 04:09:51,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:09:51,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:51,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:09:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:09:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:09:51,378 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:51,454 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-08 04:09:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:09:51,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 04:09:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:09:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 04:09:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 04:09:51,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-08 04:09:51,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:51,496 INFO L225 Difference]: With dead ends: 39 [2022-04-08 04:09:51,496 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 04:09:51,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:09:51,497 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:09:51,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:09:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 04:09:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-08 04:09:51,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:09:51,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,501 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,501 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:51,502 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-08 04:09:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-08 04:09:51,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:51,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:51,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 04:09:51,503 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 04:09:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:51,504 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-08 04:09:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-08 04:09:51,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:51,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:51,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:09:51,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:09:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-08 04:09:51,505 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2022-04-08 04:09:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:09:51,505 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-08 04:09:51,505 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-08 04:09:51,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-08 04:09:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 04:09:51,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:09:51,529 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:09:51,529 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:09:51,529 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:09:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:09:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash -185588926, now seen corresponding path program 1 times [2022-04-08 04:09:51,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:51,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [72353248] [2022-04-08 04:09:51,530 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:09:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash -185588926, now seen corresponding path program 2 times [2022-04-08 04:09:51,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:09:51,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260118797] [2022-04-08 04:09:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:09:51,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:09:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:09:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:51,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#(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(12, 2);call #Ultimate.allocInit(12, 3); {563#true} is VALID [2022-04-08 04:09:51,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-08 04:09:51,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {563#true} {563#true} #63#return; {563#true} is VALID [2022-04-08 04:09:51,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:09:51,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#(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(12, 2);call #Ultimate.allocInit(12, 3); {563#true} is VALID [2022-04-08 04:09:51,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-08 04:09:51,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #63#return; {563#true} is VALID [2022-04-08 04:09:51,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret7 := main(); {563#true} is VALID [2022-04-08 04:09:51,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {563#true} is VALID [2022-04-08 04:09:51,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {563#true} is VALID [2022-04-08 04:09:51,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {568#(= main_~z~0 0)} is VALID [2022-04-08 04:09:51,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#(= main_~z~0 0)} assume !(~z~0 % 4294967296 < 268435455); {564#false} is VALID [2022-04-08 04:09:51,582 INFO L272 TraceCheckUtils]: 9: Hoare triple {564#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {564#false} is VALID [2022-04-08 04:09:51,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#false} ~cond := #in~cond; {564#false} is VALID [2022-04-08 04:09:51,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} assume 0 == ~cond; {564#false} is VALID [2022-04-08 04:09:51,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} assume !false; {564#false} is VALID [2022-04-08 04:09:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:09:51,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:09:51,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260118797] [2022-04-08 04:09:51,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260118797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:51,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:51,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:09:51,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:09:51,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [72353248] [2022-04-08 04:09:51,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [72353248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:51,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:51,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:09:51,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020351993] [2022-04-08 04:09:51,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:09:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 04:09:51,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:09:51,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:51,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:09:51,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:51,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:09:51,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:09:51,593 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:51,654 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-08 04:09:51,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:09:51,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 04:09:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:09:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-08 04:09:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-08 04:09:51,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-08 04:09:51,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:51,690 INFO L225 Difference]: With dead ends: 39 [2022-04-08 04:09:51,690 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 04:09:51,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:09:51,691 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:09:51,691 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:09:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 04:09:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-08 04:09:51,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:09:51,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,694 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,694 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:51,695 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 04:09:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 04:09:51,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:51,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:51,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-08 04:09:51,696 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-08 04:09:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:51,697 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 04:09:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 04:09:51,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:51,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:51,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:09:51,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:09:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:09:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-08 04:09:51,698 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-04-08 04:09:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:09:51,698 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-08 04:09:51,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:09:51,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-08 04:09:51,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 04:09:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 04:09:51,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:09:51,722 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:09:51,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 04:09:51,722 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:09:51,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:09:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1431986846, now seen corresponding path program 1 times [2022-04-08 04:09:51,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:51,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1953540920] [2022-04-08 04:09:53,015 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:09:53,294 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:09:53,321 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post4_4|] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 04:09:53,324 INFO L158 Benchmark]: Toolchain (without parser) took 3432.98ms. Allocated memory was 181.4MB in the beginning and 228.6MB in the end (delta: 47.2MB). Free memory was 132.0MB in the beginning and 100.3MB in the end (delta: 31.7MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. [2022-04-08 04:09:53,324 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory was 148.2MB in the beginning and 148.1MB in the end (delta: 88.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:09:53,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.23ms. Allocated memory is still 181.4MB. Free memory was 131.9MB in the beginning and 157.0MB in the end (delta: -25.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:09:53,324 INFO L158 Benchmark]: Boogie Preprocessor took 17.99ms. Allocated memory is still 181.4MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:09:53,324 INFO L158 Benchmark]: RCFGBuilder took 205.57ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 144.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:09:53,325 INFO L158 Benchmark]: TraceAbstraction took 3016.57ms. Allocated memory was 181.4MB in the beginning and 228.6MB in the end (delta: 47.2MB). Free memory was 143.7MB in the beginning and 100.3MB in the end (delta: 43.3MB). Peak memory consumption was 91.3MB. Max. memory is 8.0GB. [2022-04-08 04:09:53,325 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory was 148.2MB in the beginning and 148.1MB in the end (delta: 88.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.23ms. Allocated memory is still 181.4MB. Free memory was 131.9MB in the beginning and 157.0MB in the end (delta: -25.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.99ms. Allocated memory is still 181.4MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 205.57ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 144.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3016.57ms. Allocated memory was 181.4MB in the beginning and 228.6MB in the end (delta: 47.2MB). Free memory was 143.7MB in the beginning and 100.3MB in the end (delta: 43.3MB). Peak memory consumption was 91.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post4_4|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post4_4|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:09:53,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...